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.

['F', 'R', 7383, 'N', 'W', 'w', 'z', 'j', 'i', 'g', 4099, 'W', 4933, 'z', '9669', 'A', 'b', 'D', '3879', '4171', '6077', 'D', '9801', '2903', '7685', '6577', 'J', '7241', '4083', 'i', 'r', '421', '1029', 'I', '6169', 'r', 'e', 5247, 'Y', 10027, 'X', 6489, 3311, 'E', 9463, 5955, 7037, 1257, 'J', 4855, 'Y', 'x', 3973, 661, 803, 2803], ['y', 95, 3807, 6437, 'g', 'S', '9669', 'A', 'b', 'D', '3879', '4171', '6077', 'D', '9801', '2903', '7685', '6577', 'J', '7241', '4083', 'i', 'r', '421', '1029', 'I', '6169', 'r', 'n', 6823, 7515]
9669, A, b, D, 3879, 4171, 6077, D, 9801, 2903, 7685, 6577, J, 7241, 4083, i, r, 421, 1029, I, 6169, r