Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['j', 'p', 'C', 1097, 6115, 5895, 'A', '6729', 'q', '9317', 'm', 'g', '2355', 's', '9535', 'q', '1735', 'i', '8257', '6339', '8673', 'P', 'N', 'M', 'V', 't', 7445, 'a', 'Y', 'n', 'L'], ['z', 9395, 7377, 'I', 'A', 6635, 8291, 2963, 'L', '6729', 'q', '9317', 'm', 'g', '2355', 's', '9535', 'q', '1735', 'i', '8257', '6339', '8673', 'P', 'F', 1891, 5435, 'n', 'B', 3359, 4529, 'c', 's', 6745, 8569, 4681, 'T', 'C', 6545]
Output:
6729, q, 9317, m, g, 2355, s, 9535, q, 1735, i, 8257, 6339, 8673, P