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.

[10007, 2945, 'x', 'w', 'K', 'b', 'k'], [7433, 4233, 'x', 'w', 'K', 'l', 'v']
Output:
x, w, K