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: ['D', 'O', 3549, 'E', 'D', 3819, 5687, 4327, 'X', 'a', 4089, '685', '9883', '543', '1017', 'D', 'j', '523', '6735', '5555', 'c', 'c', '6819', '4429', '5035', 'x', 'O', '471', '1915', '6889', '6491', '2331', '3805', '7993', '9999', '3253', 'X', '5925', 'Q', 1161, 9581, 'y', 7749, 'v'], [2675, 'c', 7715, 8253, 15, 'B', 'v', 9397, 'T', 'e', 'U', 1703, 4825, 1731, 'J', 8479, 9907, 't', 'a', 5665, 5231, 9921, 1489, 9449, '685', '9883', '543', '1017', 'D', 'j', '523', '6735', '5555', 'c', 'c', '6819', '4429', '5035', 'x', 'O', '471', '1915', '6889', '6491', '2331', '3805', '7993', '9999', '3253', 'X', '5925', 'B', 'u', 'u', 'V', 6495, 4063, 279, 7383, 'a', 1139, 3127, 'S', 'q', 'G', 9953, 5689, 'k', 'T', 6183, 8127, 'g', 6407]
Output:
685, 9883, 543, 1017, D, j, 523, 6735, 5555, c, c, 6819, 4429, 5035, x, O, 471, 1915, 6889, 6491, 2331, 3805, 7993, 9999, 3253, X, 5925