Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['W', 1663, 6635, 8057, '1507', '8255', 'l', 'S', 'T', '2149', '5037', '5067', '1885', 'k', 'P', '3075', 'N', '51', '497', '631', '9833', 'b', '4145', '8899', '8855', '9371', 'c', '4451', '2855', 'E', 'I', 't', 'b', 3191, 567, 6617, 5945, 'x', 5937, 'K', 2075], [6341, 5303, 'Z', 'K', 'M', 6251, 5249, '1507', '8255', 'l', 'S', 'T', '2149', '5037', '5067', '1885', 'k', 'P', '3075', 'N', '51', '497', '631', '9833', 'b', '4145', '8899', '8855', '9371', 'c', '4451', '2855', 'E', 'I', 't', 'z', 3135, 2569, 895, 9229, 7605, 1493, 8455, 6017, 'N', 'G', 'H', 7221, 'M', 5689, 'y', 'q', 339, 'u', 3733, 'z', 'b', 5743, 1543, 6125, 'h']
Output:
1507, 8255, l, S, T, 2149, 5037, 5067, 1885, k, P, 3075, N, 51, 497, 631, 9833, b, 4145, 8899, 8855, 9371, c, 4451, 2855, E, I, t