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.

[4325, 'k', '5021', 'c', 'm', 'r', '2875', 'f', 'X', 'L', 'G', 'W', '1665', '3649', '1171', 'w', 'b', 9121, 8841, 'W', 'I', 9307], [7359, 'q', 'T', 9571, 'G', 6971, 3753, 'c', 6303, 7389, '5021', 'c', 'm', 'r', '2875', 'f', 'X', 'L', 'G', 'W', '1665', '3649', '1171', 'G', 'O', 2199, 'b', 8727, 9443, 6383, 847, 349, 643, 8629, 6821, 6069]
Output:
5021, c, m, r, 2875, f, X, L, G, W, 1665, 3649, 1171