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

Input: Consider Input: [5363, 'h', 3845, 6217, 2315, 'm', 'O', 5573, 4601, 7145, 9561, 'q', 'r', 'T', '619', 'r', '8913', '7507', '4527', '9313', '7813', '4297', '9581', '561', 'L', 'F', '9357', '5175', '1853', 'K', 'a', '8575', 'V', '8283', 'J', '5341', 'Y', 9545, 6705, 6445, 'X', 7149, 'B', 9079, 'P', 9337, 3641, 3731, 4837, 't'], [4089, 'f', 'A', 'q', 477, '619', 'r', '8913', '7507', '4527', '9313', '7813', '4297', '9581', '561', 'L', 'F', '9357', '5175', '1853', 'K', 'a', '8575', 'V', '8283', 'J', '5341', 'q', 't', 'g', 'T', 8621, 'Z', 'L', 'd', 9207, 5705, 'Z', 'l', 'I', 'Z', 1141, 9949, 867, 'H', 'E', 3605, 3617, 331]

Output: 619, r, 8913, 7507, 4527, 9313, 7813, 4297, 9581, 561, L, F, 9357, 5175, 1853, K, a, 8575, V, 8283, J, 5341


Input: Consider Input: [8769, 8805, 'W', 'a', 'l', '9061', 'b', 'A', 'D'], [3199, 'o', 'm', 'a', 'l', '9061', 'b', 'v', 'g']

Output: a, l, 9061, b


Input: Consider Input: [9361, 4739, 9799, 8785, 1177, 549, 'R', 'z', 'Q', 3155, 'G', 4233, 'H', 'O', '3785', '5175', 'E', 'O', 'f', 'P', '1203', 'm', '5381', 'W', 's', '8743', '2449', '601', '2127', 'e', 4475, 'n', 79, 'p', 'b', 'd', 'b', 'r', 'C'], [2283, 8789, 4395, 'm', 969, 'A', 'E', 2593, 'O', '3785', '5175', 'E', 'O', 'f', 'P', '1203', 'm', '5381', 'W', 's', '8743', '2449', '601', '2127', 'q', 7913, 'G', 1089, 2033, 'm', 5263, 'g', 4755, 'y']


Output: O, 3785, 5175, E, O, f, P, 1203, m, 5381, W, s, 8743, 2449, 601, 2127