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.

['f', 9267, 'o', 'R', 6161, '6305', '7561', 'F', '5127', '8827', '9817', '7613', '5681', '9389', '6143', 'y', 'M', '3561', '3061', 'F', '3711', 'x', 'M', '3603', '2839', 'B', 4825, 3393, 'b', 5923, 'e', 'e'], ['j', 1595, 5511, 'f', 'K', 801, 'f', 'W', 'Y', 'J', 5545, 7603, '6305', '7561', 'F', '5127', '8827', '9817', '7613', '5681', '9389', '6143', 'y', 'M', '3561', '3061', 'F', '3711', 'x', 'M', '3603', '2839', 'z', 3821, 'l']
Output:
6305, 7561, F, 5127, 8827, 9817, 7613, 5681, 9389, 6143, y, M, 3561, 3061, F, 3711, x, M, 3603, 2839