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

Example Input: ['g', 9605, '2057', '3119', 'R', 'X', 'p', '4501', 'h', '347', '7435', 'J', '4601', '4601', 'E', '8787', 'I', 'i', 3357, 'i', 6367, 't', 2131, 'J', 'W', 501, 679, 'o', 8079, 'O', 'u'], [761, 8395, '2057', '3119', 'R', 'X', 'p', '4501', 'h', '347', '7435', 'J', '4601', '4601', 'E', '8787', 'I', 'K', 'n', 9433]
Example Output: 2057, 3119, R, X, p, 4501, h, 347, 7435, J, 4601, 4601, E, 8787, I

Example Input: [5307, 'b', 'I', '9451', 'W', 7941], [8087, 'U', 'I', '9451', 'g', 'I']
Example Output: I, 9451

Example Input: [4483, 2437, 'Y', '2943', 'a', 7363], ['o', 'K', 'Y', '2943', 'v', 'H']
Example Output:
Y, 2943