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.

['x', 'O', 'x', '2567', 'e', 3809], [2595, 1831, 'x', '2567', 'r', 'g']
Output:
x, 2567