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.

['J', 1259, 'C', '1055', 'v', 'a'], ['m', 'o', 'C', '1055', 'G', 5017]
Output:
C, 1055