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

Example Input: ['J', 'h', '8587', 'b', 't', 'k'], [8955, 7253, '8587', 'b', 'e', 8655]
Example Output: 8587, b

Example Input: ['G', 'T', 'D', 'j', 'g', 'w', 'n', 'D', 'V', '8209', '9691', '6551', 'N', '4913', '471', '9355', 'b', 'w', '4505', '6427', 'P', '5957', 'v', 693, 'f', 'J', 'f', 10007, 'o', 863, 'o', 'Z', 'd', 'Q'], [8181, 693, 's', 'V', 'V', '8209', '9691', '6551', 'N', '4913', '471', '9355', 'b', 'w', '4505', '6427', 'P', '5957', 'w', 4477, 'd', 1717, 525, 7147, 'g', 6803, 'j', 8033, 'Y', 't', 5059, 4371]
Example Output: V, 8209, 9691, 6551, N, 4913, 471, 9355, b, w, 4505, 6427, P, 5957

Example Input: ['O', 4197, 225, 3673, 1705, 'O', 5889, 1703, 3967, 't', 7275, 'g', '2885', 'w', 'G', '4287', 'L', '9543', '5871', '541', 'u', '6083', '3313', 'C', 'Z', 'm', 'D', 'l', 't', '4763', 'g', '5295', '6511', 'b', '9153', 'W', 'u', 'M', 'n', 'F', 'b', 9865, 9957, 8411, 4095, 'l', 'y', 'O', 2265, 'Z'], ['D', 3613, 'R', 6453, 'I', 4975, 335, 'Z', 'i', 7349, 8317, 4199, 'o', 4771, 3871, '2885', 'w', 'G', '4287', 'L', '9543', '5871', '541', 'u', '6083', '3313', 'C', 'Z', 'm', 'D', 'l', 't', '4763', 'g', '5295', '6511', 'b', '9153', 'W', 'u', 'M', 'w', 'I', 'V', 6241, 'N', 'O', 'E', 5147, 'm', 5475, 2387, 'M', 3879]
Example Output:
2885, w, G, 4287, L, 9543, 5871, 541, u, 6083, 3313, C, Z, m, D, l, t, 4763, g, 5295, 6511, b, 9153, W, u, M