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

Example Input: [6507, 8623, 6879, '1327', '6971', 'd', 'A', 3663, 7831], [1711, 4751, 3479, '1327', '6971', 'd', 'u', 1771]
Example Output: 1327, 6971, d

Example Input: ['i', 4077, 'Z', 6231, 2337, 'h', '1181', '1631', '2605', '587', '1477', '2707', 'R', 'O', 'd', 1355, 'n'], [505, 'A', 8789, 75, 'q', 'h', '1181', '1631', '2605', '587', '1477', '2707', 'R', 'O', 'e', 'r', 'I', 'm', 1525, 3577]
Example Output: h, 1181, 1631, 2605, 587, 1477, 2707, R, O

Example Input: [7687, 2013, 'V', 'm', 'D', '5587', '1553', 'H', 'F', '4379', '7825', 'j', 'B', 1223, 'D', 6135, 6505], [7033, 'Q', 2973, 6529, 1757, 'F', 10003, '5587', '1553', 'H', 'F', '4379', '7825', 'j', 'h', 7491, 'e', 483]
Example Output:
5587, 1553, H, F, 4379, 7825, j