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

Example Input: ['K', 1657, '5001', '8571', '2343', '9471', 'P', '6369', '9299', 'X', 'n', 3631, 'o', 'm'], ['P', 6249, 7565, 's', 1041, 'V', 'D', '5001', '8571', '2343', '9471', 'P', '6369', '9299', 'n', 'U', 'z', 2559, 5379, 6985, 6059]
Example Output: 5001, 8571, 2343, 9471, P, 6369, 9299

Example Input: ['U', 637, 'o', '3327', 'A', '7495', 'i', 'b', '2067', '5555', '3619', '1697', 't', 3715, 'Q'], ['u', 921, 4467, 2095, 345, 'b', '3327', 'A', '7495', 'i', 'b', '2067', '5555', '3619', '1697', 'E', 7935, 'B', 6341, 'N', 'V', 7655]
Example Output: 3327, A, 7495, i, b, 2067, 5555, 3619, 1697

Example Input: ['u', 'f', 'R', 't', 'C', 'G'], ['I', 1873, 'R', 't', 'k', 'B']
Example Output:
R, t