In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Example Input: [4839, 2307, '5609', 'V', 's', '7059', 'N', '3761', 'i', '161', '1987', 'N', 'J', 'h', 'k', 'P'], [2615, 't', 5171, 'V', 'q', '5609', 'V', 's', '7059', 'N', '3761', 'i', '161', '1987', 'N', 'p', 5261, 3251]
Example Output: 5609, V, s, 7059, N, 3761, i, 161, 1987, N

Example Input: ['C', 'd', 'U', 'O', 'X', 'Q', 75, 'n', '1745', '4477', '5381', 'S', 'G', '257', 'Q', '2891', 'e', 'U'], ['G', 'H', 7457, 'N', '1745', '4477', '5381', 'S', 'G', '257', 'Q', '2891', 'G', 'x', 'm', 865, 9285, 1495, 'l', 'J']
Example Output: 1745, 4477, 5381, S, G, 257, Q, 2891

Example Input: ['C', 'A', '6359', 'I', 'D', 'l', 'P', 'U'], ['o', 3257, '6359', 'I', 'D', 'j', 'D', 'j']
Example Output:
6359, I, D