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.

[6669, 993, 2869, 9509, 8993, '879', 'F', '5007', 'z', '2983', '5427', 'r', '8807', 'B', '3877', 'N', '4805', 'g', 'g', '3835', 'C', 'A', 'r'], [3363, 4639, 6463, 4467, 'C', 1229, 5053, 197, '879', 'F', '5007', 'z', '2983', '5427', 'r', '8807', 'B', '3877', 'N', '4805', 'g', 'g', '3835', 'U', 'y', 8593, 'K', 5271, 6989, 'x', 'S', 623, 'e', 2235]
Output:
879, F, 5007, z, 2983, 5427, r, 8807, B, 3877, N, 4805, g, g, 3835