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

Example Input: [8827, 'K', 7387, 7215, 'Y', '4759', 'V', 'l', '5621', '391', 'V', '6741', 'O', '3153', '4133', '2785', '8699', '9719', '1445', '487', 'm', '3969', 'u', 'u', '8779', 'y', 'R', 7083, 'U', 3361, 'u', 'b', 'M', 5833, 'D', 7509, 'D'], ['Y', 4615, 'l', 2547, '4759', 'V', 'l', '5621', '391', 'V', '6741', 'O', '3153', '4133', '2785', '8699', '9719', '1445', '487', 'm', '3969', 'u', 'u', '8779', 'b', 'W', 3225, 291, 2681, 'Z', 'k', 8059, 'A', 7261, 4877, 2019, 'g', 4621, 4541, 3343, 997, 6091, 5577, 'q']
Example Output: 4759, V, l, 5621, 391, V, 6741, O, 3153, 4133, 2785, 8699, 9719, 1445, 487, m, 3969, u, u, 8779

Example Input: ['W', 'A', '5747', 'i', 'M', 'N', 8861], [1997, 'D', 5205, '5747', 'i', 'M', 'D', 3319, 1895]
Example Output: 5747, i, M

Example Input: [1849, 9799, 'c', 'S', 5905, 'M', 'D', 703, 'M', 'j', 'x', '7239', 'M', 'D', 'Z', 'h', 'K', 'y', '4941', '1711', 'P', '7839', 'm', 'D', 'i', 'f', 'q', 5535, 9971, 9841, 'H', 'o', 895, 8461, 'L', 'p', 7151, 9115, 1013, 'C', 2447], ['I', 'I', 9899, 4171, 'J', 5517, 'M', 'j', 'x', '7239', 'M', 'D', 'Z', 'h', 'K', 'y', '4941', '1711', 'P', '7839', 'm', 'D', 'i', 'f', 'A', 'N', 'Y']
Example Output:
M, j, x, 7239, M, D, Z, h, K, y, 4941, 1711, P, 7839, m, D, i, f