You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

[5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Solution: 8297, b
Why? Here, '8297, b' is the longest common subsequence in both the input lists [5797, 8817, '8297', 'b', 'U', 'b'] and [5843, 8809, '8297', 'b', 'W', 'C'].

New input: ['M', 'I', '8247', '1441', 'i', 's', 'L'], ['p', 391, '8247', '1441', 'i', 'E', 'g', 't']
Solution:
8247, 1441, i