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.

[895, 't', '1615', '1407', 'x', 'J'], ['t', 'y', '1615', '1407', 'A', 'l']
Output:
1615, 1407