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.

['n', 'o', 'r', 2855, 4375, 1117, 4949, 'b', 3039, 6949, 'z', 8865, 'M', '1305', 's', '7995', 'k', 's', 'g', '4915', 'I', 'c', '1817', '4223', 'e', '5985', '1559', 'L', '5949', '6273', 'n', 'o', '4181', 'J', 9797, 'Z', 'G', 9043, 'I', 1763, 3451, 'z', 3703, 8141, 4609, 'A', 'T', 'l', 5819, 1135, 'H'], [9385, 6151, 7065, 'n', 2893, 857, 3287, 8409, 'h', 'H', 9447, 1397, 1225, 3123, 'B', 'Q', 4267, 'Z', '1305', 's', '7995', 'k', 's', 'g', '4915', 'I', 'c', '1817', '4223', 'e', '5985', '1559', 'L', '5949', '6273', 'n', 'o', '4181', 'W', 3251, 9559, 9821, 7451, 1433, 'O', 7139, 9433]
1305, s, 7995, k, s, g, 4915, I, c, 1817, 4223, e, 5985, 1559, L, 5949, 6273, n, o, 4181