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

Input: Consider Input: [1201, 'x', 'Z', '1951', '6643', '4463', 'N', 'W', '4625', 'w', 'D', 3599, 'B', 2299], ['T', 'z', 'A', 'Z', '1951', '6643', '4463', 'N', 'W', '4625', 'w', 'T', 'M', 'M']

Output: Z, 1951, 6643, 4463, N, W, 4625, w


Input: Consider Input: ['i', 'f', '7401', 'y', 'D', 's', 'l', '2179', '6257', 'V', 'r', 'r', 'F', 45, 5965, 2375], ['K', 'V', '7401', 'y', 'D', 's', 'l', '2179', '6257', 't', 6019, 4243, 'r', 9711, 'j', 2361]

Output: 7401, y, D, s, l, 2179, 6257


Input: Consider Input: ['O', 'e', 't', '2707', 'Z', 'i', 'Q', 7897, 365], ['s', 5607, 5101, 't', '2707', 'Z', 'i', 'l', 'a', 2549, 4585]


Output: t, 2707, Z, i