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

Ex Input:
['J', 'h', '8587', 'b', 't', 'k'], [8955, 7253, '8587', 'b', 'e', 8655]

Ex Output:
8587, b


Ex Input:
['z', 2719, 'i', 'l', 'Z', 'u', '6823', 'g', '1665', 'e', 'L', 'A', 6591, 'F'], [4147, 'T', 'Z', 'u', '6823', 'g', '1665', 'd', 8245, 'i']

Ex Output:
Z, u, 6823, g, 1665


Ex Input:
['n', 'x', 'F', 6517, 6535, 'q', 'v', 5987, 1287, 'g', 2305, 'I', '3651', '7979', '4677', 'T', 'S', 'q', '7035', 'F', 'o', '8211', '747', 'm', 'C', 'u', 'b', 8113, 7947, 9965, 7113, 'e', 'I'], [8211, 6747, 2155, 2425, 'I', 4895, 1393, 3929, 'S', 'v', 'm', 'P', 'I', '3651', '7979', '4677', 'T', 'S', 'q', '7035', 'F', 'o', '8211', '747', 'N', 'r', 8151, 'Z']

Ex Output:

I, 3651, 7979, 4677, T, S, q, 7035, F, o, 8211, 747