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

Ex Input:
['y', 'b', 'A', 'K', 887, '9169', '1575', '5233', '1749', '5739', 'A', 'V', 8989], [3381, 5213, 9463, 8631, 2091, '9169', '1575', '5233', '1749', '5739', 'h', 1679, 8181]

Ex Output:
9169, 1575, 5233, 1749, 5739


Ex Input:
[9995, 237, 'f', 'q', '4659', 'C', '1809', 'g', '8581', '3805', '8549', 'H', '8421', 'J', '889', '1383', 'a', 'u', 'u', 'i', 6289, 6979, 8697, 9881, 1747, 4169, 99, 'V', 261, 'n', 2261, 9455], [5613, 'B', 'z', 3941, 571, 9137, 'G', 'a', 3419, 2805, 1425, 'x', 'f', 'q', '4659', 'C', '1809', 'g', '8581', '3805', '8549', 'H', '8421', 'J', '889', '1383', 'a', 'u', 'u', 'n', 3707, 5783]

Ex Output:
f, q, 4659, C, 1809, g, 8581, 3805, 8549, H, 8421, J, 889, 1383, a, u, u


Ex Input:
['d', 2287, 'Z', 'l', 'r', 4087], ['L', 9113, 'Z', 'l', 'w', 'D']

Ex Output:

Z, l