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.

['z', 7477, 'u', 'g', 'D', 'I'], [3353, 275, 'u', 'g', 'l', 137]
Output:
u, g