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

Example Input: ['f', 'I', 'G', 627, 6145, 4779, '7903', 'c', '6667', 'j', 'N', 'F', '8035', 'E', 'u', 'V', '3605', 'y', '9445', '1541', '6709', 'Z', 'g', 'W', '7809', 't', '1887', 's', 'a', 9101, 2313, 't', 1319, 7473, 'p', 'a', 'd', 2643, 3033, 8709], [6835, 'a', 'g', 6065, 'v', 'm', 3313, 'V', '7903', 'c', '6667', 'j', 'N', 'F', '8035', 'E', 'u', 'V', '3605', 'y', '9445', '1541', '6709', 'Z', 'g', 'W', '7809', 't', '1887', 'X', 609, 'c', 6763, 2011, 'u', 'I', 8969, 315, 1553, 967, 'c', 'W', 9607, 'u', 'E', 'g', 3559, 'd', 99]
Example Output: 7903, c, 6667, j, N, F, 8035, E, u, V, 3605, y, 9445, 1541, 6709, Z, g, W, 7809, t, 1887

Example Input: [5861, 'Z', 1225, '3813', '8297', 't', '9301', 'd', 9323, 825], [5491, 'a', '3813', '8297', 't', '9301', 'Y', 'L', 'j', 5005]
Example Output: 3813, 8297, t, 9301

Example Input: ['o', 8299, 'W', 'a', 'I', 1239, 'I', 'M', 1813, 'k', 3519, 1825, 't', 5645, '4397', '2357', 'B', 'y', '1561', 'z', 'G', 'D', 'Y', 'g', '9033', 'w', '3639', '455', '5055', '8215', '5059', '3039', '7423', 'L', 'V', 't', 'b', 'K', 'x', 6315, 1315, 'x', 'P', 8213, 5997, 6657, 'j', 6699, 9073], ['X', 3103, 1137, 2477, 5621, 'I', 'w', 5307, 'Y', 5693, 6873, 1833, 4297, 'f', 'U', 8463, 'x', 'U', 8625, 'Q', '4397', '2357', 'B', 'y', '1561', 'z', 'G', 'D', 'Y', 'g', '9033', 'w', '3639', '455', '5055', '8215', '5059', '3039', '7423', 'L', 'V', 't', 'C', 'W', 'q', 6601, 'v', 8543, 201, 3383, 6731]
Example Output:
4397, 2357, B, y, 1561, z, G, D, Y, g, 9033, w, 3639, 455, 5055, 8215, 5059, 3039, 7423, L, V, t