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

Ex Input:
['i', 'n', '7509', '7241', 'V', 'k', 205, 'H'], ['s', 4349, 7023, '7509', '7241', 'V', 'O', 't', 9237]

Ex Output:
7509, 7241, V


Ex Input:
[5307, 'b', 'I', '9451', 'W', 7941], [8087, 'U', 'I', '9451', 'g', 'I']

Ex Output:
I, 9451


Ex Input:
['m', 'R', '1287', 'J', '6053', 'l', '6613', 'V', 'a', 'S', 9647], ['e', 8349, 'n', 1603, 2031, '1287', 'J', '6053', 'l', '6613', 'V', 'A', 1135, 3685, 'H', 'E', 'T']

Ex Output:

1287, J, 6053, l, 6613, V