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.

[9795, 661, 'D', 'J', 'u', 4435, 'F', 3229, 'u', 4719, 'W', '867', '4759', '9601', 'o', '2481', 'W', '4817', 'h', 'Z', 'Q', 'e', '3319', '5993', '6109', '9803', 'J', 'b', '1727', '7787', '8225', 'b', 'G', '4143', '4221', 't', 'X', 9437, 3687, 8343, 'N', 47, 'T', 6445, 'R', 4691, 'H'], ['n', 'k', 8709, 'I', 'W', '867', '4759', '9601', 'o', '2481', 'W', '4817', 'h', 'Z', 'Q', 'e', '3319', '5993', '6109', '9803', 'J', 'b', '1727', '7787', '8225', 'b', 'G', '4143', '4221', 't', 'S', 6429, 'B', 1871, 'I', 4863, 7907, 'G', 2103, 'U', 4171, 9123, 'w', 1545, 'K', 7597]
Output:
W, 867, 4759, 9601, o, 2481, W, 4817, h, Z, Q, e, 3319, 5993, 6109, 9803, J, b, 1727, 7787, 8225, b, G, 4143, 4221, t