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

Ex Input:
[1043, 4021, 'b', 'e', '5055', 'N', 7081], ['o', 'S', 'b', 'e', '5055', 'q', 8711, 9911]

Ex Output:
b, e, 5055


Ex Input:
[3441, 443, 'D', 'n', '5111', 'F', 'T', 'i', 'O', '2763', '417', '9849', '4313', 'I', 3749, 9061, 'W', 'y'], ['O', 9869, 'X', 4785, 6259, 9043, 'h', '5111', 'F', 'T', 'i', 'O', '2763', '417', '9849', '4313', 'w', 'T', 'q', 8411, 't', 4719]

Ex Output:
5111, F, T, i, O, 2763, 417, 9849, 4313


Ex Input:
['e', 'l', 'C', 'I', '6769', '5791', '8807', 'C', 'H', 8055], ['W', 'i', '6769', '5791', '8807', 'C', 'a', 9801]

Ex Output:

6769, 5791, 8807, C