Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['g', 267, 'y', 'U', 2447, 'h', 'W', 2455, 't', 'R', 49, 6133, 6065, '1313', '8485', 'Q', '2023', '9667', 'p', 'M', '4877', 'T', '7419', 'U', '8061', '6073', 'm', 'r', '9875', 'p', '2299', '145', 'l', 'm', 'y', 8649, 's', 5819, 'O', 4501, 'k', 9027], ['Y', 'a', 'm', 'y', 'g', 'c', 'a', 'E', '1313', '8485', 'Q', '2023', '9667', 'p', 'M', '4877', 'T', '7419', 'U', '8061', '6073', 'm', 'r', '9875', 'p', '2299', '145', 'l', 'm', 'g', 2549, 'K', 5743, 'w', 'w', 3183, 'k', 9553, 339, 'f', 'R', 1693, 'v', 'g', 'k', 5883, 8827, 's', 'H', 'l']
Output:
1313, 8485, Q, 2023, 9667, p, M, 4877, T, 7419, U, 8061, 6073, m, r, 9875, p, 2299, 145, l, m