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

Example Input: ['W', 'A', '5747', 'i', 'M', 'N', 8861], [1997, 'D', 5205, '5747', 'i', 'M', 'D', 3319, 1895]
Example Output: 5747, i, M

Example Input: ['z', 'F', 'H', 'E', 1495, 'u', 't', 'm', 'o', '1165', 'b', 75, 'B'], ['n', 'H', 'M', 'j', 3999, 'u', 't', 'm', 'o', '1165', 'r', 'x', 'W']
Example Output: u, t, m, o, 1165

Example Input: [6127, 'f', 'Z', '2195', 'A', 1487], ['R', 'j', 'Z', '2195', 'Q', 7217]
Example Output:
Z, 2195

