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

Example Input: [93, 'H', 'd', 'z', 'G', 'u', '9033', '709', '6413', 'C', 'j', 8909, 5687], [9451, 2867, 'G', 'u', '9033', '709', '6413', 'Y', 'y']
Example Output: G, u, 9033, 709, 6413

Example Input: ['s', 'M', 'y', 'b', 'S', 'P', 'J', '8781', '7865', '1961', '6767', 'a', 'r', 'H', 'j', 'a', 'b', 'i', 'A', 2579, 8191, 'g', 3591, 4195, 'q', 1357], ['F', 'U', 'G', 7763, 1385, 'm', 1089, 4701, 1565, 'm', 9713, 'P', 'J', '8781', '7865', '1961', '6767', 'a', 'r', 'H', 'j', 'a', 'X', 'b', 'f', 7385, 'G']
Example Output: P, J, 8781, 7865, 1961, 6767, a, r, H, j, a

Example Input: ['W', 6383, 'l', 'r', '289', '7907', '3647', '2295', '6113', 'O', 'k', 1361, 'Q', 'x', 'b'], ['h', 'y', 'r', '289', '7907', '3647', '2295', '6113', 'O', 'K', 9219, 'r', 6967, 3133]
Example Output:
r, 289, 7907, 3647, 2295, 6113, O