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

Example Input: ['p', 'Z', 'Z', 5929, 7441, 'g', 7897, 'p', 4341, 'F', 'c', 'i', '1227', 'p', '6197', 'M', '3549', 'G', '11', '7667', 'T', '7819', 'T', '8965', '4725', 'R', 'Q', '4873', '4701', 'F', 2669, 3809, 645, 6921, 'R', 9767, 'h', 'J', 7893, 'h'], [937, 'a', 'i', '1227', 'p', '6197', 'M', '3549', 'G', '11', '7667', 'T', '7819', 'T', '8965', '4725', 'R', 'Q', '4873', '4701', 'Z', 'q', 'u', 6333, 5793, 'a', 783, 'K', 'R']
Example Output: i, 1227, p, 6197, M, 3549, G, 11, 7667, T, 7819, T, 8965, 4725, R, Q, 4873, 4701

Example Input: ['l', 8387, '6019', 'r', 't', 'Y'], ['S', 'q', '6019', 'r', 'Z', 9863]
Example Output: 6019, r

Example Input: [1183, 623, 'y', 's', 'J', 'g'], [6301, 8897, 'y', 's', 4947, 6215]
Example Output:
y, s