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

Example Input: [7319, 'V', 'f', 't', 'M', 'L'], [4655, 3353, 'f', 't', 'G', 1263]
Example Output: f, t

Example Input: ['C', 1723, 8981, 3173, 3163, 'j', 'L', 4781, 'N', '5925', '2501', '9697', 'v', 'C', 'O', 'A', '9205', '8339', '3385', 'w', 3467, 'j', 6655, 'P', 8443, 9655], ['v', 'W', 5661, 'z', 'm', 8477, '5925', '2501', '9697', 'v', 'C', 'O', 'A', '9205', '8339', '3385', 'S', 6891, 'H', 'B', 8541]
Example Output: 5925, 2501, 9697, v, C, O, A, 9205, 8339, 3385

Example Input: ['D', 'Q', 'S', 'e', 'i', '4069', 'E', 't', 'i', '5477', '6991', '7061', 'T', 9765, 5233, 1165, 903], ['j', 'n', 2893, 'C', 7273, 6423, '4069', 'E', 't', 'i', '5477', '6991', '7061', 'Z', 'P']
Example Output:
4069, E, t, i, 5477, 6991, 7061