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

Input: Consider Input: [7975, 4703, 'c', '8363', '1673', 'U', 'w', 6977], [3235, 'G', 'c', '8363', '1673', 'N', 'p']

Output: c, 8363, 1673


Input: Consider Input: ['K', 6723, 7053, 'g', 6793, 'h', 'C', 'H', 'J', 'K', '1061', '9585', 'F', 'l', '5651', 'f', 'P', '9147', '5227', '2861', '6421', 'V', '1009', '6639', '3701', 'T', 'o', 'j', 5777, 3173, 'N', 'Q', 'O', 'm', 4693], ['r', 5349, 503, 'Q', 8435, 'Y', 6633, 'W', 'J', 'K', '1061', '9585', 'F', 'l', '5651', 'f', 'P', '9147', '5227', '2861', '6421', 'V', '1009', '6639', '3701', 'Q', 'Z', 8433, 'h', 8205, 'm', 6605, 5051, 'w', 'o', 3177, 't', 9005, 'v', 'G']

Output: J, K, 1061, 9585, F, l, 5651, f, P, 9147, 5227, 2861, 6421, V, 1009, 6639, 3701


Input: Consider Input: ['q', 9243, 'j', 4763, 'E', '4057', '9931', 'G', 'q', '1293', 'O', 'm', '2539', '6683', 'J', '7685', '8543', '461', 'A', '1995', 'r', 'a', 'f', 'w', 9943, 'F', 3357, 'I', 5765, 6225, 'T'], ['Q', 'C', 'x', 'J', 'v', 4809, 'a', 'z', 'G', 7835, '4057', '9931', 'G', 'q', '1293', 'O', 'm', '2539', '6683', 'J', '7685', '8543', '461', 'A', '1995', 'r', 'a', 'h', 8131, 9289, 4649, 'K', 'F', 9447, 'M', 'C', 'b', 'p', 'B', 3339, 'w', 7819, 'n', 'p']


Output: 4057, 9931, G, q, 1293, O, m, 2539, 6683, J, 7685, 8543, 461, A, 1995, r, a