Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['x', 5659, 'L', 'P', 8559, 957, 'g', 8417, 1959, 7069, 'd', 'G', 'G', 'E', 77, 1347, 2909, 8117, 'C', '5699', 't', '2157', '2027', 'L', 'l', 's', 'A', '3749', '2901', '6411', '2411', '1067', '5577', '8369', 'Y', 'R', 'G', '1699', 'M', 'w', '9299', '7161', 's', 5201, 9079], ['N', 867, 'C', '5699', 't', '2157', '2027', 'L', 'l', 's', 'A', '3749', '2901', '6411', '2411', '1067', '5577', '8369', 'Y', 'R', 'G', '1699', 'M', 'w', '9299', '7161', 'G', 'Z', 77, 't', 'p', 3815, 6231, 'D', 5121]
Output:
C, 5699, t, 2157, 2027, L, l, s, A, 3749, 2901, 6411, 2411, 1067, 5577, 8369, Y, R, G, 1699, M, w, 9299, 7161