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

Input: Consider Input: [6971, 'd', 'J', 'p', 'F', 5463, 'F', 'P', 1897, 'J', 'O', 'j', 'H', 'y', '3659', '9455', 'P', '9829', 'm', 'Q', 7829, 'C', 5311], ['E', 'R', 'H', 217, 'J', 'O', 'j', 'H', 'y', '3659', '9455', 'P', '9829', 'm', 'T', 5849, 1449]

Output: J, O, j, H, y, 3659, 9455, P, 9829, m


Input: Consider Input: ['U', 6489, 'o', 'e', 'Z', 'G', '8175', 'r', '1915', '8587', '8845', 'I', 'B', 'R', 'N', 9533, 'd'], ['U', 4287, 'f', 'R', 1407, 3893, 6739, 'o', 'e', 'Z', 'G', '8175', 'r', '1915', '8587', '8845', 'Z', 2981, 'i', 'a', 'k', 5909, 'S', 9997]

Output: o, e, Z, G, 8175, r, 1915, 8587, 8845


Input: Consider Input: [9079, 'q', 'Y', 'x', '7205', 'a', 'm'], [1981, 'Q', 'Y', 'x', '7205', 'v', 1097]


Output: Y, x, 7205