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

Example Input: ['w', 'i', 5729, 'G', 8651, '1845', 'a', '715', 'O', '3649', 'w', '8821', '2545', '1011', 'u', '895', '4133', 'n', '3759', 'w', 'X', 'R', 'A', 5949, 8347, 9169, 'N', 9753, 4353, 9447, 5747, 4347, 'f', 8247, 'D', 'y'], ['b', 'd', 237, 'y', 9735, 'M', 'j', 'f', 9789, 'x', 4217, '1845', 'a', '715', 'O', '3649', 'w', '8821', '2545', '1011', 'u', '895', '4133', 'n', '3759', 'w', 'X', 'E', 'e', 4021, 7065, 1651, 'n']
Example Output: 1845, a, 715, O, 3649, w, 8821, 2545, 1011, u, 895, 4133, n, 3759, w, X

Example Input: [2255, 4205, 'U', '7567', 'k', 5167], ['Q', 9439, 'U', '7567', 'H', 1307]
Example Output: U, 7567

Example Input: ['J', 1259, 'C', '1055', 'v', 'a'], ['m', 'o', 'C', '1055', 'G', 5017]
Example Output:
C, 1055