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', 'g', 'K', 'D', 'e', 'g', 'X', 'n', 6679, 3009, 'r', 2701, '5367', '2427', '7801', '1475', 'E', '403', 'r', 'E', 'U', '9743', 'f', 'l', '6915', 'J', 'V', 'J', 1713], ['e', 4397, 1719, 8335, 3921, 'D', 9425, 'o', 3477, '5367', '2427', '7801', '1475', 'E', '403', 'r', 'E', 'U', '9743', 'f', 'l', '6915', 'O', 'Z', 1177, 7225, 5169, 2429, 'Z', 4817, 'z', 8945]
Output:
5367, 2427, 7801, 1475, E, 403, r, E, U, 9743, f, l, 6915