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

Input: Consider Input: ['c', 'N', 9495, 305, 1779, 7447, 8519, 2777, '2205', '2411', '4203', 'g', 'V', '8037', 'h', '5963', 'L', '715', 'A', 'p', 'k', 'h', 'A', 7013, 509, 'G'], ['V', 2467, 9505, '2205', '2411', '4203', 'g', 'V', '8037', 'h', '5963', 'L', '715', 'W', 4557, 's', 4431]

Output: 2205, 2411, 4203, g, V, 8037, h, 5963, L, 715


Input: Consider Input: [3707, 6473, 'o', '495', '3897', 'O', 'x', '2409', '6843', '3477', '5411', 'G', 9269, 5835, 2723, 'm', 'n', 6209], [7513, 4579, 6017, 7723, '495', '3897', 'O', 'x', '2409', '6843', '3477', '5411', 'w', 'T', 'g', 'M', 'V']

Output: 495, 3897, O, x, 2409, 6843, 3477, 5411


Input: Consider Input: [6149, 3667, 8427, 1449, 7845, 1829, 2997, 'c', 'B', 'Y', 8479, 8693, 't', 'H', 'E', 'z', 563, 'a', 'y', 7109, 4535, 'Z', 3489, '2767', '1675', 'k', 'Y', '5867', 'o', 'p', '2607', '1661', 'R', '4593', '4919', 'p', 'p', 'T', 'Q', '407', '6967', '6993', '3909', 'b', 'I', 'A', '2125', 'F', 'A', 'H', 'A', 'm', 9339, 4761, 'z', 1853, 'c', 4977, 4523, 'h', 8917, 'n'], ['q', 5345, 'A', 'A', 'A', 'b', '2767', '1675', 'k', 'Y', '5867', 'o', 'p', '2607', '1661', 'R', '4593', '4919', 'p', 'p', 'T', 'Q', '407', '6967', '6993', '3909', 'b', 'I', 'A', '2125', 'F', 'A', 'H', 'D', 'm', 9055, 'x', 'n', 'b', 6493]


Output: 2767, 1675, k, Y, 5867, o, p, 2607, 1661, R, 4593, 4919, p, p, T, Q, 407, 6967, 6993, 3909, b, I, A, 2125, F, A, H