You will be given a definition of a task first, then some input of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['n', 4423, 'O', 'm', 'w', 7655, 'L', 467, 'A', 2101, 'H', 'n', 'q', 4113, 2489, 7595, 5079, 's', '8931', '9541', 'R', '699', 'd', 'O', '3331', '965', '5429', '347', '1261', 't', 'z', '6223', 'y', 'F', '7837', '3401', '8967', 'P', 'F', 'i', '2389', 'M', '7553', 'z', 'G', 1947, 1681, 2415, 2229, 7057, 8033, 3717, 4343, 'S', 9465, 'u', 8731, 'G', 'X', 'd', 'E', 'o', 6629, 1699, 8679, 3765, 5421, 'Y', 'b'], [2475, 4157, 'G', 'J', 'Z', 'C', 5751, 'f', 'e', 'd', 8075, 5197, 'w', 'R', 'a', 's', '8931', '9541', 'R', '699', 'd', 'O', '3331', '965', '5429', '347', '1261', 't', 'z', '6223', 'y', 'F', '7837', '3401', '8967', 'P', 'F', 'i', '2389', 'M', '7553', 'Z', 'Z', 2597, 861]
Output:
s, 8931, 9541, R, 699, d, O, 3331, 965, 5429, 347, 1261, t, z, 6223, y, F, 7837, 3401, 8967, P, F, i, 2389, M, 7553