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: [8909, 'F', 'G', 'H', 'S', 5937, 3911, 'O', 'y', '1485', 'y', 'C', '1313', '429', '9215', '769', 'I', 'z', '1197', 'U', 9885, 'w', 'e', 'T'], ['S', 'A', 'O', 'y', '1485', 'y', 'C', '1313', '429', '9215', '769', 'I', 'z', '1197', 'S', 3769, 1835, 'r', 2109]
Output:
O, y, 1485, y, C, 1313, 429, 9215, 769, I, z, 1197