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

Example Input: ['G', 9195, 'n', 'x', 'A', '3777', 'd', 'K', 'W', '1911', '93', '5157', 'j', 'd', 'L'], ['y', 'I', 8025, 5165, 4825, 'L', 'A', 10001, 'x', 'A', '3777', 'd', 'K', 'W', '1911', '93', '5157', 'E', 'b']
Example Output: x, A, 3777, d, K, W, 1911, 93, 5157

Example Input: [8507, 'H', 'o', 'N', 'r', 'I', 3733, 'r', 6877, 5193, 1389, 7105, '8513', 'A', '5801', 'M', '1339', '6353', 'C', '3591', 'W', '7703', 'D', 'i', '1975', '9169', '7427', '8345', 'l', 'C', 'C', 'd', '7579', '1463', '8451', 'H', 'K', 'u', '8561', 'x', 3575, 'A', 7405, 'o', 'J', 6163, 'y', 'O', 'g', 7633, 'A', 6531, 4627, 'P', 'O', 'j', 'S', 'b', 'c', 'V', 7923, 'K', 'i', 5625, 893, 'V'], ['W', 'O', 6909, 'a', 1667, 'n', 'D', 'i', 7719, 4109, 4167, 4099, 5473, 'b', 'g', 'R', '8513', 'A', '5801', 'M', '1339', '6353', 'C', '3591', 'W', '7703', 'D', 'i', '1975', '9169', '7427', '8345', 'l', 'C', 'C', 'd', '7579', '1463', '8451', 'H', 'K', 'u', '8561', 'h', 'Z', 383, 2829, 5461, 1851, 'F', 'l', 981, 6545, 'v', 7707, 'W', 675, 'V', 'C', 599, 'd', 1967, 'X', 'y', 'B', 'K']
Example Output: 8513, A, 5801, M, 1339, 6353, C, 3591, W, 7703, D, i, 1975, 9169, 7427, 8345, l, C, C, d, 7579, 1463, 8451, H, K, u, 8561

Example Input: [7575, 5753, 'd', 'b', '6795', '6893', 'r', 'k', '4941', 'n', 9771, 'F', 'C', 649], ['N', 'C', 'P', 1679, '6795', '6893', 'r', 'k', '4941', 'V', 'v', 'Q', 'N']
Example Output:
6795, 6893, r, k, 4941