Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [7997, 4059, 'X', 'O', 'b', 'e', 'p', 9477, 'n', 'q', 'z', '6301', 'h', 'r', 'S', '661', 'H', '4391', 'k', 'j', 'H', 6909, 1223, 9917, 4887, 'I', 'i', 'z', 'D'], [8069, 'p', 5891, 'L', 4141, 7461, 'n', 'q', 'z', '6301', 'h', 'r', 'S', '661', 'H', '4391', 'k', 'T', 'l', 6439, 'x', 3767, 1179, 483, 'X', 'J']
Output:
n, q, z, 6301, h, r, S, 661, H, 4391, k