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

Example Input: [9369, 5975, 'W', 'd', 'I', 6029, 3693, 'I', '8101', 'K', '5209', 'l', 'v', 'W', '4841', '6399', 'T', 'F', 'k', '2165', 'w', 'k', 'B', 'o', 'T', 4201, 7599, 'c', 'W'], ['p', 'p', 'L', 'J', '8101', 'K', '5209', 'l', 'v', 'W', '4841', '6399', 'T', 'F', 'k', '2165', 'Y', 'P', 8947, 'q']
Example Output: 8101, K, 5209, l, v, W, 4841, 6399, T, F, k, 2165

Example Input: [6017, 2811, '8157', '9625', 'P', 3629], [7857, 1357, '8157', '9625', 'z', 'z']
Example Output: 8157, 9625

Example Input: ['F', 1869, 'p', 't', '8525', '6807', 'S', '2429', '849', 'I', 'N', 'E'], [3945, 4773, 3553, 9839, '8525', '6807', 'S', '2429', '849', 'x', 4057]
Example Output:
8525, 6807, S, 2429, 849