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', 1953, 971, 'Z', 'M', 'T', 's', '2845', '3487', '7155', 'e', '7383', '1429', '5037', 'T', 'B', 'S', '7175', '7307', '9441', 'H', 6231], ['Z', 6955, 'f', 2949, 4035, 'u', 2453, 749, 'k', 'f', 'C', 'r', 'L', '2845', '3487', '7155', 'e', '7383', '1429', '5037', 'T', 'B', 'S', '7175', '7307', '9441', 'e', 'K', 'M', 913, 'W', 8975, 'u', 8713, 'L']
Output:
2845, 3487, 7155, e, 7383, 1429, 5037, T, B, S, 7175, 7307, 9441