Given the task definition, example input & output, solve the new input case.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Example: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Output: 8297, b
Here, '8297, b' is the longest common subsequence in both the input lists [5797, 8817, '8297', 'b', 'U', 'b'] and [5843, 8809, '8297', 'b', 'W', 'C'].

New input case for you: ['L', 9737, 1553, 'N', 'Z', '5225', '7159', 'k', 's', 'g'], [7435, 7397, 'N', 'Z', '5225', '7159', 'n', 'd', 4537]
Output:
N, Z, 5225, 7159