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

Input: Consider Input: [5307, 'b', 'I', '9451', 'W', 7941], [8087, 'U', 'I', '9451', 'g', 'I']

Output: I, 9451


Input: Consider Input: [675, 'N', '7605', 'W', 'J', 'E', '2099', 'I', 'i'], ['T', 8995, 'E', 'U', '7605', 'W', 'J', 'E', '2099', 'R', 3629, 977]

Output: 7605, W, J, E, 2099


Input: Consider Input: ['A', 2397, 'w', 2339, 4523, 7001, 5495, 'I', '3907', '3029', 'w', '333', 'r', '9715', 'W', 3489, 'm', 3031, 3275], [4271, 4287, 7987, 1629, 'I', 'P', 9705, 'I', '3907', '3029', 'w', '333', 'r', '9715', 'n', 'H', 4099, 4337, 'D']


Output: I, 3907, 3029, w, 333, r, 9715