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

Ex Input:
['S', 'o', 9247, 'W', 'G', 5923, 4791, '8083', '3207', '9137', '9359', '9297', '9667', '75', 'h', '9671', 's', 'T', 5829, 'p'], ['K', 'U', 'H', 8611, 1005, 'I', '8083', '3207', '9137', '9359', '9297', '9667', '75', 'h', '9671', 'C', 9577, 8279, 2247, 'x', 4917, 'H']

Ex Output:
8083, 3207, 9137, 9359, 9297, 9667, 75, h, 9671


Ex Input:
[8833, 'F', 15, 'I', 'v', '6401', 'd', 173, 'Z'], [1225, 'z', 'I', 'v', '6401', 'p', 4403, 5813]

Ex Output:
I, v, 6401


Ex 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]

Ex Output:

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