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.

['u', 1475, 9335, 9277, 'R', 'P', '2699', '5269', 'W', 'B', '5391', '8969', '151', 'M', '8915', 'w', '3285', '7847', 'V', 'F', '547', 'z', 's', 'z', '3587', '6463', 'C', '7155', '8637', 'g', 'X', 'x', 2971, 8691, 7657, 7707, 'C', 3, 1961, 'Q', 7127, 'V', 813], ['u', 'k', '2699', '5269', 'W', 'B', '5391', '8969', '151', 'M', '8915', 'w', '3285', '7847', 'V', 'F', '547', 'z', 's', 'z', '3587', '6463', 'C', '7155', '8637', 'l', 'D', 'j', 'n', 2457, 8323, 1977, 8855, 'R', 'U', 'Q', 3043]
Output:
2699, 5269, W, B, 5391, 8969, 151, M, 8915, w, 3285, 7847, V, F, 547, z, s, z, 3587, 6463, C, 7155, 8637