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.

['A', 4037, 2607, 8389, 'V', 4171, 'E', 'v', 'R', 'G', 8687, 'C', 't', 's', 'f', '9731', '5349', '1399', 'n', 'h', '8005', '433', 'S', '1229', 'Q', '6463', 'D', '323', 'F', '4731', 'k', 'I', '4537', '1769', '4703', '4281', 'Q', 'g', 'y', 1309, 5401, 'o', 6613, 2855, 'F', 4003, 3839, 'H', 'c', 'Y', 1801, 'F', 1707, 'C'], [8511, 'o', 'n', 'Y', 'p', 'p', 'E', 5225, 6867, 421, 5255, 10025, 3309, 'H', 6883, 'j', 't', 's', 'f', '9731', '5349', '1399', 'n', 'h', '8005', '433', 'S', '1229', 'Q', '6463', 'D', '323', 'F', '4731', 'k', 'I', '4537', '1769', '4703', '4281', 'A', 4943, 4183, 3971, 1871]
Output:
t, s, f, 9731, 5349, 1399, n, h, 8005, 433, S, 1229, Q, 6463, D, 323, F, 4731, k, I, 4537, 1769, 4703, 4281