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.

[3543, 7527, 'N', 9411, 8699, 7807, 'u', 't', '2691', '2785', 'L', '9959', '1011', 'f', 'w', '9605', 'd', '8249', 'W', '5805', '8807', '6949', 'c', 'N', 'M', '3037', 'r', '7999', 'X', 7917, 9455, 3171, 'w'], ['c', 'v', 5257, 'u', 't', '2691', '2785', 'L', '9959', '1011', 'f', 'w', '9605', 'd', '8249', 'W', '5805', '8807', '6949', 'c', 'N', 'M', '3037', 'r', '7999', 'Z', 4617, 'b', 'n', 1141, 3343, 'Q', 4083, 5837, 413]
Output:
u, t, 2691, 2785, L, 9959, 1011, f, w, 9605, d, 8249, W, 5805, 8807, 6949, c, N, M, 3037, r, 7999