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

Example Input: ['i', 4077, 'Z', 6231, 2337, 'h', '1181', '1631', '2605', '587', '1477', '2707', 'R', 'O', 'd', 1355, 'n'], [505, 'A', 8789, 75, 'q', 'h', '1181', '1631', '2605', '587', '1477', '2707', 'R', 'O', 'e', 'r', 'I', 'm', 1525, 3577]
Example Output: h, 1181, 1631, 2605, 587, 1477, 2707, R, O

Example Input: ['J', 'G', 'h', 'z', '6979', 'W', 'W', '7681', 's', '8827', 'm', 't', 'z', 9681, 'z'], ['Q', 4625, 4609, 2245, 'h', 'z', '6979', 'W', 'W', '7681', 's', '8827', 'A', 9751, 'U', 7397]
Example Output: h, z, 6979, W, W, 7681, s, 8827

Example Input: [4521, 749, 7291, 'j', '5865', 'N', 'A', '6623', 'U', 8777, 3021, 7223], [1007, 4187, 2791, 5819, 'O', 'j', '5865', 'N', 'A', '6623', 'p', 7471, 7521, 2965]
Example Output:
j, 5865, N, A, 6623