Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['X', 'G', 8583, 8171, 'T', 8559, '2859', '9375', 'n', '5793', '3091', 'r', 'D', '3861', '1661', '3545', '7163', 'a', 'H', '5935', 'k', '8791', '5419', '513', '8377', '8901', '1949', 'n', 1961, 'N', 'p', 1317, 5463, 'e', 2581], [8977, 1569, 6611, 1031, 3729, 4823, 6483, 'T', 4991, 4793, 'e', 'm', 'N', 1043, 4969, 'm', 7567, 405, 'h', 7207, '2859', '9375', 'n', '5793', '3091', 'r', 'D', '3861', '1661', '3545', '7163', 'a', 'H', '5935', 'k', '8791', '5419', '513', '8377', '8901', '1949', 'C', 6667, 7951, 'e', 4681, 5915, 6807, 'C', 6119, 'V', 'r']
Output:
2859, 9375, n, 5793, 3091, r, D, 3861, 1661, 3545, 7163, a, H, 5935, k, 8791, 5419, 513, 8377, 8901, 1949