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.

['H', 6465, 'G', '7135', 'k', 'z', 'N', 8789], [5263, 'M', 'G', '7135', 'k', 'W', 'z']
Output:
G, 7135, k