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

Input: Consider Input: ['Y', 'z', 5335, 'X', 3843, 'D', 4457, 2327, 'V', 7231, 'y', 4551, 'W', 9241, '7147', '6713', '9717', '8795', '3161', 'V', '1129', '2943', '9809', 'a', '3273', 'y', 'R', 'M', 'g', 'E', 'D', 'd', 'x', 5331, 7187, 'J', 3839, 't'], [1485, 'f', 8207, 5859, 'D', 'k', 't', 'r', 'z', 613, 9091, 4893, 5755, '7147', '6713', '9717', '8795', '3161', 'V', '1129', '2943', '9809', 'a', '3273', 'y', 'R', 'M', 'Q', 5331, 'c', 3531, 6477, 'a']

Output: 7147, 6713, 9717, 8795, 3161, V, 1129, 2943, 9809, a, 3273, y, R, M


Input: Consider Input: [431, 4017, 'R', 'a', 'F', '9581', 'Y', 'f', 'z', 'b', 1235], [4115, 'u', 'g', 'f', 2455, 'a', 'F', '9581', 'Y', 'f', 'z', 'm', 7245, 'I', 7021]

Output: a, F, 9581, Y, f, z


Input: Consider Input: ['x', 9693, 5733, 6629, '3239', '7349', '3201', '6589', 'n', 'j', 'w', 8993, 8401, 'n'], ['e', 'i', 605, '3239', '7349', '3201', '6589', 'n', 'R', 'W', 6857]


Output: 3239, 7349, 3201, 6589, n