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

Example Input: [7849, 813, 1309, 3749, '10001', 'g', '1057', 'c', 't', 't', 'i', 2269, 'M', 'q', 373], ['d', 4077, 3209, 'g', 5643, '10001', 'g', '1057', 'c', 't', 't', 'h', 'Y', 8349, 'q', 3939, 1333]
Example Output: 10001, g, 1057, c, t, t

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: ['A', 'y', 'F', 't', 8985, 'R', 3339, 5539, '9419', '1983', '1651', 'j', 'b', 'Y', '3955', 'q', 'J', 'S'], ['X', 5295, 'Z', 9789, 'T', 'Z', '9419', '1983', '1651', 'j', 'b', 'Y', '3955', 'q', 'r', 3377, 'J', 537]
Example Output:
9419, 1983, 1651, j, b, Y, 3955, q