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

Input: Consider Input: [8833, 'F', 15, 'I', 'v', '6401', 'd', 173, 'Z'], [1225, 'z', 'I', 'v', '6401', 'p', 4403, 5813]

Output: I, v, 6401


Input: Consider Input: ['o', 'f', '955', 'y', 'O', 2181], ['M', 'l', '955', 'y', 'h', 5209]

Output: 955, y


Input: Consider Input: ['M', 'X', 5323, 'B', 'w', '9499', '8291', 'S', '2583', 'J', 5143], ['i', 'O', 'w', '9499', '8291', 'S', '2583', 'O', 'I', 'B', 2643, 'x']


Output: w, 9499, 8291, S, 2583