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

Input: Consider Input: ['z', 2719, 'i', 'l', 'Z', 'u', '6823', 'g', '1665', 'e', 'L', 'A', 6591, 'F'], [4147, 'T', 'Z', 'u', '6823', 'g', '1665', 'd', 8245, 'i']

Output: Z, u, 6823, g, 1665


Input: Consider Input: [7155, 'R', 5819, 'a', 'C', 4603, 1003, 'W', 'N', 'Z', 'q', 'A', 'w', 'r', 'N', '6611', 'r', '8975', 'b', 'T', 'c', 2763, 'W', 'n', 7521, 4855, 9907, 'o', 'C', 1185, 'g'], [9921, 55, 5361, 'k', 'N', 'Z', 'q', 'A', 'w', 'r', 'N', '6611', 'r', '8975', 'b', 'T', 'h', 8665, 'O', 633]

Output: N, Z, q, A, w, r, N, 6611, r, 8975, b, T


Input: Consider Input: [3385, 7999, 9145, 'S', '2917', '935', 'Q', 'd'], [4463, 2265, 2275, 'S', '2917', '935', 'j', 'f']


Output: S, 2917, 935