Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['I', 'i', 7409, 'p', 'C', '4157', '9067', '1201', 'q', 'T', 'c', '6741', 'x', '1853', 'C', 'Y', 'q', '5869', 'D', 'N', '9155', '2501', '3597', 'W', 'o', '4915', '6223', '3929', '6893', 'r', 'a', 5851, 'G', 'i', 'T', 'R', 'P', 'n', 'o', 'D', 'N', 'W', 9945, 8461], ['R', 8631, 9003, 'i', 8181, 1463, 4899, 7549, 'T', 2803, 1657, 5479, 'F', 'd', 'p', 'C', '4157', '9067', '1201', 'q', 'T', 'c', '6741', 'x', '1853', 'C', 'Y', 'q', '5869', 'D', 'N', '9155', '2501', '3597', 'W', 'o', '4915', '6223', '3929', '6893', 'r', 'R', 'g', 5723, 5437, 5441, 'I', 'g', 'u', 5771, 4253, 'A', 'g', 9257, 'W']
Output:
p, C, 4157, 9067, 1201, q, T, c, 6741, x, 1853, C, Y, q, 5869, D, N, 9155, 2501, 3597, W, o, 4915, 6223, 3929, 6893, r