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

Example Input: [621, 7677, 'b', '889', '6721', 'H', 'd', 'S'], [8151, 'F', 'b', '889', '6721', 'h', 4123]
Example Output: b, 889, 6721

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

Example Input: ['L', 1653, 4833, 3597, 'B', 'A', 'g', '6735', '6737', '6929', '3051', 'v', '1223', '497', 'K', 4721, 'L', 'H', 'F', 'y', 2849], [9635, 3451, 'A', 'g', '6735', '6737', '6929', '3051', 'v', '1223', '497', 'd', 'f']
Example Output:
A, g, 6735, 6737, 6929, 3051, v, 1223, 497