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.

['e', 'L', 735, 2297, 'A', 'Y', 'm', 'V', 'N', '3301', '6737', '9931', 'T', 'C', 'O', 'x', '5443', 'G', 'M', 'n', '755', '1611', 'C', 'b', '7079', 'q', 'h', 6767], ['V', 'm', 6249, 'Q', 'C', 6861, 9731, 'B', 'n', 7935, 'j', 'a', 1267, 8593, 1867, 'A', 'Y', 'm', 'V', 'N', '3301', '6737', '9931', 'T', 'C', 'O', 'x', '5443', 'G', 'M', 'n', '755', '1611', 'C', 'b', '7079', 'S', 1193, 'F', 6181]
A, Y, m, V, N, 3301, 6737, 9931, T, C, O, x, 5443, G, M, n, 755, 1611, C, b, 7079