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

Input: Consider Input: [3707, 6473, 'o', '495', '3897', 'O', 'x', '2409', '6843', '3477', '5411', 'G', 9269, 5835, 2723, 'm', 'n', 6209], [7513, 4579, 6017, 7723, '495', '3897', 'O', 'x', '2409', '6843', '3477', '5411', 'w', 'T', 'g', 'M', 'V']

Output: 495, 3897, O, x, 2409, 6843, 3477, 5411


Input: Consider Input: ['J', 'h', '8587', 'b', 't', 'k'], [8955, 7253, '8587', 'b', 'e', 8655]

Output: 8587, b


Input: Consider Input: ['P', 7265, 'u', 8971, 3011, '8253', '3743', '2169', 't', 'w', 'J', '8535', 'R', 'l', 9061], ['q', 'h', 't', 'n', 3023, 1393, 'B', '8253', '3743', '2169', 't', 'w', 'J', '8535', 'A', 'Z', 2683, 8053, 'b', 3787, 'F']


Output: 8253, 3743, 2169, t, w, J, 8535