Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['J', 5907, 'K', 'K', 'E', 'Z', 'R', 5483, 'I', '2665', '5393', 'i', '6157', '1409', 'y', 'N', '537', 'h', '6541', '5901', 'm', 'C', 'M', 9175, 6187, 3481, 4265, 849, 7551, 3367, 'S'], [565, 'A', 'U', 'Y', 'd', 'A', '2665', '5393', 'i', '6157', '1409', 'y', 'N', '537', 'h', '6541', '5901', 'm', 'X', 'y', 6843, 'J', 'C', 's', 4665, 'q']
Output:
2665, 5393, i, 6157, 1409, y, N, 537, h, 6541, 5901, m