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

Input: Consider Input: ['A', 'f', 's', 619, 'P', '6773', '2907', 'j', 'Y', '3815', '5619', '3681', '1259', 'k', 'k', 'p', '7817', 'e', '1227', 'T', '7201', 'o', 'o', 'W', 'U', 'E', '4881', 'h', '9013', '8427', 'W', 'B', '5309', 'V', 'L'], [7877, 9179, 'B', 'F', 'e', 4663, 'd', 7957, 'F', 'F', 'k', 'f', 8559, 'U', '6773', '2907', 'j', 'Y', '3815', '5619', '3681', '1259', 'k', 'k', 'p', '7817', 'e', '1227', 'T', '7201', 'o', 'o', 'W', 'U', 'E', '4881', 'h', '9013', '8427', 'W', 'B', '5309', 'J', 'R', 't', 'J', 'D', 'U', 'x', 'G', 'y', 'L', 7841, 'g', 's', 8385, 1631, 'Z', 6679, 4419, 'Y', 9253, 3709, 'E', 'a']

Output: 6773, 2907, j, Y, 3815, 5619, 3681, 1259, k, k, p, 7817, e, 1227, T, 7201, o, o, W, U, E, 4881, h, 9013, 8427, W, B, 5309

Input: Consider Input: ['v', 1629, 't', 'y', 'R', 'k', 10021, 7155, '7241', '8007', 'N', '4295', 'O', '6233', '6893', '3293', 'J', '789', '85', '2423', 'o', 3491, 'z', 'i', 6959, 865], ['Q', 5541, 6301, '7241', '8007', 'N', '4295', 'O', '6233', '6893', '3293', 'J', '789', '85', '2423', 'D', 3297, 8731, 8807, 99, 'h', 3177, 2689, 'H', 'u', 'S', 833]

Output: 7241, 8007, N, 4295, O, 6233, 6893, 3293, J, 789, 85, 2423

Input: Consider Input: [2451, 7207, 'd', 4501, 'U', 10001, 'L', 3181, 3773, 'g', 'a', 9065, '1997', '9651', 'Q', 'M', '8409', 'U', '3979', '7771', 'Y', '8613', 'n', '9371', 'r', 5473, 'C', 7451, 8895, 9239, 841, 'f', 9631, 7153, 4867], ['h', 3023, 'p', '1997', '9651', 'Q', 'M', '8409', 'U', '3979', '7771', 'Y', '8613', 'n', '9371', 'q', 8857, 8221, 'm', 'G', 2479]
Output: 1997, 9651, Q, M, 8409, U, 3979, 7771, Y, 8613, n, 9371