Given the task definition, example input & output, solve the new input case.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Example: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Output: 8297, b
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 case for you: ['B', 'R', 't', 't', 'A', 'z', 9785, 3575, 'o', 'u', 5087, 'L', '1781', 'V', '8559', '911', 'F', 'I', 'O', '2163', 'O', 'q', 'c', 'h', 'y', 'O', 'z', 'L', 7885, 's', 5219], ['y', 'k', 1719, 'L', 'f', 'I', 'u', 4839, 'L', '1781', 'V', '8559', '911', 'F', 'I', 'O', '2163', 'O', 'q', 'c', 'h', 'y', 'F', 'z', 'O', 'e', 'K', 'x']
Output:
L, 1781, V, 8559, 911, F, I, O, 2163, O, q, c, h, y