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: ['X', 'b', 6957, 355, 'U', 'F', 1867, 1539, 'h', 4457, 8189, 'i', 6055, 2041, 3455, 'x', 'i', 'c', 'O', 'v', '5699', '5937', 'V', '9579', '691', 's', '6949', 'O', 'T', 'j', 'q', '881', '6113', 'e', '2051', '503', 'v', '4591', 'X', 'u', 'x', 5509, 'B', 'H', 'K', 1165, 'B', 7609, 'G', 'q', 3405, 4291, 747, 1461, 'k', 'e', 'x', 3251, 8489, 6793], ['q', 185, 9355, 5123, 's', 8471, 3845, 'C', 6177, 4155, 'v', 'w', 'f', 'b', 9225, 7797, 'i', 'c', 'O', 'v', '5699', '5937', 'V', '9579', '691', 's', '6949', 'O', 'T', 'j', 'q', '881', '6113', 'e', '2051', '503', 'v', '4591', 'X', 'u', 'E', 7495, 'o', 'H', 245]
Output:
i, c, O, v, 5699, 5937, V, 9579, 691, s, 6949, O, T, j, q, 881, 6113, e, 2051, 503, v, 4591, X, u