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.

['g', 6949, 'F', 1171, 1095, 4489, 3477, 'Y', 9867, 'H', 'B', 'S', 'm', 8731, 'C', 's', '4567', '4195', 'g', '2181', '1537', 'o', '25', 'a', 'B', '253', 'R', 'B', 'Y', 'L', '5125', '6719', 'E', 'x', 's', 9319, 2107, 1057, 4047, 2667, 'H', 1617], ['X', 3293, 'd', 4717, 6663, 7063, 923, 'd', '4567', '4195', 'g', '2181', '1537', 'o', '25', 'a', 'B', '253', 'R', 'B', 'Y', 'L', '5125', '6719', 'E', 'Z', 891, 'c', 4891, 6859, 'N', 'D', 'y', 'e', 7135, 'd', 2723, 4789, 'G', 'f']
Output:
4567, 4195, g, 2181, 1537, o, 25, a, B, 253, R, B, Y, L, 5125, 6719, E