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

Input: Consider Input: ['s', 'M', 'y', 'b', 'S', 'P', 'J', '8781', '7865', '1961', '6767', 'a', 'r', 'H', 'j', 'a', 'b', 'i', 'A', 2579, 8191, 'g', 3591, 4195, 'q', 1357], ['F', 'U', 'G', 7763, 1385, 'm', 1089, 4701, 1565, 'm', 9713, 'P', 'J', '8781', '7865', '1961', '6767', 'a', 'r', 'H', 'j', 'a', 'X', 'b', 'f', 7385, 'G']

Output: P, J, 8781, 7865, 1961, 6767, a, r, H, j, a


Input: Consider Input: [2413, 'l', 'o', 9687, 3939, 6935, '7821', '9179', '8181', 'K', '4993', '4813', 'x', 'A', 'O', '2477', 'b', 'H', 'I', 'z', 'I'], [4625, 6943, 'e', 'B', 'p', 'r', 'y', '7821', '9179', '8181', 'K', '4993', '4813', 'x', 'A', 'O', '2477', 'b', 'H', 'I', 'G', 'L', 8247, 'N', 8965, 8763, 'N', 'p', 7181, 'A', 'J', 'W']

Output: 7821, 9179, 8181, K, 4993, 4813, x, A, O, 2477, b, H, I


Input: Consider Input: ['W', 4607, 'w', 'w', 'u', 's', 'y'], [1635, 5797, 'w', 'w', 'u', 'k', 4539]


Output: w, w, u