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

Ex Input:
[7849, 813, 1309, 3749, '10001', 'g', '1057', 'c', 't', 't', 'i', 2269, 'M', 'q', 373], ['d', 4077, 3209, 'g', 5643, '10001', 'g', '1057', 'c', 't', 't', 'h', 'Y', 8349, 'q', 3939, 1333]

Ex Output:
10001, g, 1057, c, t, t


Ex Input:
['c', 'h', 9399, 'U', 'e', '1183', '9537', 'K', 'e', 'p', 'i', 'W', 'T', 9917, 'F', 'g', 8159], [4949, 'I', 'r', 4087, 'U', 'e', '1183', '9537', 'K', 'e', 'p', 'z', 9843]

Ex Output:
U, e, 1183, 9537, K, e, p


Ex Input:
['t', 'w', 'Y', 'G', '4073', '2999', 'q', 1629, 'H'], ['J', 'S', 'M', 's', 'Y', 'G', '4073', '2999', 'a', 'G', 7213, 5951]

Ex Output:

Y, G, 4073, 2999