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: [8325, 'J', '1099', 'p', 's', '4837', '9163', '7431', '9555', 'O', 'x', 4625, 2525], ['d', 'C', '1099', 'p', 's', '4837', '9163', '7431', '9555', 't', 'O', 8579, 'K', 6715]
Solution:
1099, p, s, 4837, 9163, 7431, 9555