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

Input: Consider Input: [2255, 4205, 'U', '7567', 'k', 5167], ['Q', 9439, 'U', '7567', 'H', 1307]

Output: U, 7567


Input: Consider Input: [5861, 'Z', 1225, '3813', '8297', 't', '9301', 'd', 9323, 825], [5491, 'a', '3813', '8297', 't', '9301', 'Y', 'L', 'j', 5005]

Output: 3813, 8297, t, 9301


Input: Consider Input: [2809, 't', 'N', 'u', 'q', 8883, 'E', 'F', 'h', 'O', '1255', 'C', 'o', '7565', '3507', 'W', 'D', 'i', 'R', '7943', 'B', 'm', 6161, 3459, 5513, 7241, 'm', 'm', 'l'], [4019, 9055, 5153, 'F', 'Q', 237, 'O', 4279, 'p', 'N', 'O', '1255', 'C', 'o', '7565', '3507', 'W', 'D', 'i', 'R', '7943', 'w', 8005]


Output: O, 1255, C, o, 7565, 3507, W, D, i, R, 7943