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

Input: Consider Input: ['m', 'K', 2769, 'i', 'k', 853, 'P', '9255', 'N', '8281', 'f', 'm', 'V', 'a', 3525, 7823, 2111, 'T'], ['Q', 1337, 'I', 'P', '9255', 'N', '8281', 'f', 'm', 'g', 'M', 3873]

Output: P, 9255, N, 8281, f, m


Input: Consider Input: ['G', 9195, 'n', 'x', 'A', '3777', 'd', 'K', 'W', '1911', '93', '5157', 'j', 'd', 'L'], ['y', 'I', 8025, 5165, 4825, 'L', 'A', 10001, 'x', 'A', '3777', 'd', 'K', 'W', '1911', '93', '5157', 'E', 'b']

Output: x, A, 3777, d, K, W, 1911, 93, 5157


Input: Consider Input: ['N', 3793, 'x', '4653', 'e', '9587', '2507', '9801', 'd', 'B', 507, 'm', 'p'], ['k', 6723, 7555, 'x', '4653', 'e', '9587', '2507', '9801', 't', 's']


Output: x, 4653, e, 9587, 2507, 9801