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: [9641, 'B', 'y', 'v', 'i', '9045', 'p', 'm', '7301', '1745', '3663', 'V', 'b', 'D', 8515, 'Q', 'j'], [3813, 8751, 'j', 5351, 6977, 'y', 'v', 'i', '9045', 'p', 'm', '7301', '1745', '3663', 'A', 4741]
Solution:
y, v, i, 9045, p, m, 7301, 1745, 3663