Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['N', 'C', 8749, 8255, 6557, 'U', 7421, 'Y', 10007, 'O', 'R', 'k', 'I', 'O', 6309, 7177, 5851, '6229', 'o', 'T', 'e', '8943', 'f', 'm', '4985', 'x', 'r', '8153', 'a', '7895', '4707', '4865', 'v', 't', 'c', 'f', 'b', 'a', 6937, 9239, 7489, 2549, 2293, 'g', 'j'], ['w', 6525, 'q', 8197, 'K', 6911, 'x', 6645, 1419, 'E', 'W', 'Z', 'j', 7947, 'F', 'Y', 6133, '6229', 'o', 'T', 'e', '8943', 'f', 'm', '4985', 'x', 'r', '8153', 'a', '7895', '4707', '4865', 'v', 't', 'S', 1531, 8157, 'b', 2321, 'i', 'w', 7469, 7759, 'l', 4755, 3281, 2715, 'D', 3789, 3597, 'X']
Output:
6229, o, T, e, 8943, f, m, 4985, x, r, 8153, a, 7895, 4707, 4865, v, t