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.

['o', 'e', 'z', '6247', '1581', 'k', 'i', '1581', 'S', 'm', 'i', 'E', 'w', 'B', '3021', 'M', 'c', 'Z', '3907', 'D', 9911, 8455, 10017, 7023, 6977, 5521, 'f', 'l', 4367, 'm', 'x', 2931, 'b', 1077, 'y'], [7257, 'M', 'n', 2363, 835, 'A', 6351, 5917, 1095, 'f', 8259, 'X', 'm', 7071, 'z', '6247', '1581', 'k', 'i', '1581', 'S', 'm', 'i', 'E', 'w', 'B', '3021', 'M', 'c', 'Z', '3907', 'l', 2143, 'S', 'q', 'n', 7743]
Output:
z, 6247, 1581, k, i, 1581, S, m, i, E, w, B, 3021, M, c, Z, 3907