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.

[2473, 'i', 'L', 'M', 9667, '7433', 'N', '7259', '7825', 'e', '7489', '5871', '6599', 'J', 'z', 'c', 'l', 683, 9217], [6801, 'b', 6977, 'q', 4459, 'W', 'a', 2487, '7433', 'N', '7259', '7825', 'e', '7489', '5871', '6599', 'J', 'z', 'e', 'h', 1331, 4321]
Output:
7433, N, 7259, 7825, e, 7489, 5871, 6599, J, z