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: [6721, 'Y', 'R', 'f', 9793, 7411, 1019, 1303, 'G', 'r', 'I', 'f', 'x', 'r', 8119, 'a', 'y', '9937', '3935', 'E', 'b', 'H', 'K', 'O', 'N', 'M', 'G', '2941', '5361', '8369', '3627', '6703', 'Z', 'K', 4879, 3557, 'W', 6271, 8877, 5091, 'n', 'L', 77], [2423, 'q', 861, 'u', 'a', 'y', '9937', '3935', 'E', 'b', 'H', 'K', 'O', 'N', 'M', 'G', '2941', '5361', '8369', '3627', '6703', 'v', 4989, 'Y', 7889, 3275, 'X', 'D', 6499, 757, 3429, 7165]
Output:
a, y, 9937, 3935, E, b, H, K, O, N, M, G, 2941, 5361, 8369, 3627, 6703