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.

[3949, 5603, 'O', 2441, 'x', 8605, 815, 5489, 295, 6763, 'a', 'k', 2347, 'I', '8551', '2495', 'a', 'y', 'z', 'w', '5097', 'h', 'I', '5031', 'F', '8305', '9227', '3699', 'D', '9209', 'y', '2763', 'c', 'W', 'D', 773, 5495, 'T', 'C', 4981, 'Y', 'X'], [9525, 'O', 7105, 'I', 1605, 2379, 'b', 'z', '8551', '2495', 'a', 'y', 'z', 'w', '5097', 'h', 'I', '5031', 'F', '8305', '9227', '3699', 'D', '9209', 'y', '2763', 'c', 'Y', 'R', 'A']
8551, 2495, a, y, z, w, 5097, h, I, 5031, F, 8305, 9227, 3699, D, 9209, y, 2763, c