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: [165, 'W', 'H', 'p', 'w', 'U', 'L', 'S', '4977', '9777', '2201', '8303', '1823', 'S', '1475', '4837', 'N', 4991], ['T', 'l', 'V', 209, 9783, 'E', 953, 'z', 'y', 'U', 'L', 'S', '4977', '9777', '2201', '8303', '1823', 'S', '1475', '4837', 'D', 2023]
Output:
U, L, S, 4977, 9777, 2201, 8303, 1823, S, 1475, 4837