Given the task definition and input, reply with output. In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['M', 't', 'W', 'O', 1943, 8525, 8943, 4289, 's', 'M', '1485', '7703', 'a', '1103', '2881', 't', '385', '777', '2299', '9733', '5495', '5121', 'q', '9275', '8119', 'i', 'L', 4565, 'j', 7005, 'H', 'c', 5421, 8429, 9215, 'T', 1795, 8257, 1361, 7613, 'c', 'k', 'w'], [6001, 'z', 'C', 7285, 't', 'H', 'M', 'w', 'P', 'a', 2043, 9843, 4571, 931, 9381, 'M', '1485', '7703', 'a', '1103', '2881', 't', '385', '777', '2299', '9733', '5495', '5121', 'q', '9275', '8119', 'i', 'o', 'b', 'x', 'x', 'l', 'a', 2837, 'm', 'n', 'N', 5103, 1985, 1801, 'a', 'O', 'F', 'x']
M, 1485, 7703, a, 1103, 2881, t, 385, 777, 2299, 9733, 5495, 5121, q, 9275, 8119, i