In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

[EX Q]: ['J', 'h', '8587', 'b', 't', 'k'], [8955, 7253, '8587', 'b', 'e', 8655]
[EX A]: 8587, b

[EX Q]: [5639, 'n', 'J', '9525', 'B', 'o', 's', 'P'], ['t', 893, 4667, '9525', 'B', 'o', 7501, 'z', 6255]
[EX A]: 9525, B, o

[EX Q]: [8353, 2919, 'B', 4425, 'I', 6017, 9627, '7957', '6895', 'C', 'A', 'a', '1185', '9813', 'q', '899', '7405', 'L', 'W', 8513, 'e', 'd', 4931, 1611, 'I', 'e', 'R', 2391], [8863, 'd', 2569, '7957', '6895', 'C', 'A', 'a', '1185', '9813', 'q', '899', '7405', 'L', 'Z', 6881, 'd', 'j']
[EX A]:
7957, 6895, C, A, a, 1185, 9813, q, 899, 7405, L