Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [5537, 1097, 99, 2995, 295, 'q', 'f', 'S', 387, 9391, 8659, 'V', 'T', 6757, 2599, 'o', 6297, 7909, 6565, 'T', 'z', 'K', 'n', 2259, 'j', 'd', '2899', 'm', '7459', '1399', '549', '6417', 's', '5247', 'q', 'x', '6509', 'L', '5553', 'I', 'z', '6177', '35', 'j', '1141', 'k', '875', 'm', 'm', 'p', 'T', 'y'], ['p', 'F', 9375, 'g', 'j', 'd', '2899', 'm', '7459', '1399', '549', '6417', 's', '5247', 'q', 'x', '6509', 'L', '5553', 'I', 'z', '6177', '35', 'j', '1141', 'k', '875', 'm', 'm', 'M', 5307, 5647, 'N', 6759, 'N', 'r', 7917, 8103, 'H', 4657, 'h', 's', 'L', 1785, 2761, 3579, 4979, 'E']
Output:
j, d, 2899, m, 7459, 1399, 549, 6417, s, 5247, q, x, 6509, L, 5553, I, z, 6177, 35, j, 1141, k, 875, m, m