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

Example Input: ['w', 'Z', 8573, 'o', 'D', 'J', 5037, 2641, 'O', 'T', '9477', 'u', 'n', 'x', '693', 'o', 'l', '9113', '3117', '3743', '1889', 'G', 'P', 6189, 7671, 5677], ['P', 1411, 'O', 'T', '9477', 'u', 'n', 'x', '693', 'o', 'l', '9113', '3117', '3743', '1889', 'P', 'K', 'l', 'U', 2505, 3803, 9459, 'H', 1427, 1453, 'g']
Example Output: O, T, 9477, u, n, x, 693, o, l, 9113, 3117, 3743, 1889

Example Input: ['o', 833, 'H', 'I', 'x', 'u', 'a', 'L', 'H', 'g', '4519', 'J', 'E'], [9993, 'z', 'g', 'u', 'a', 'L', 'H', 'g', '4519', 'V', 9115]
Example Output: u, a, L, H, g, 4519

Example Input: ['o', 833, 'H', 'I', 'x', 'u', 'a', 'L', 'H', 'g', '4519', 'J', 'E'], [9993, 'z', 'g', 'u', 'a', 'L', 'H', 'g', '4519', 'V', 9115]
Example Output:
u, a, L, H, g, 4519