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: [1973, 'A', '7045', '2583', '4661', '8477', 'l', '1737', 'J', 'a', 'R', 'K', 'd', '4419', '2907', '5157', '7185', 'E', 'w', 845], [6341, 'i', 3553, 'g', 'K', 'K', 6649, 'p', 3279, 6389, 'K', 'E', 'V', 'j', '7045', '2583', '4661', '8477', 'l', '1737', 'J', 'a', 'R', 'K', 'd', '4419', '2907', '5157', '7185', 'Z', 447, 'G', 'Y', 'z', 6619, 'T', 3921, 3725, 4477, 891, 2725]
Solution:
7045, 2583, 4661, 8477, l, 1737, J, a, R, K, d, 4419, 2907, 5157, 7185