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.

['Z', 4427, 'S', 2269, 'W', 'W', 'F', 5543, 4345, 'J', 'q', 5263, 7517, 471, 'B', '2635', 'j', '1093', 'j', '5033', 'x', '293', '553', '543', 'J', '1725', '601', 'x', '5281', '7091', '3753', 'o', '7627', 'o', 'T', '3225', 'd', 607, 'G', 'i', 7457, 5823, 6287, 339, 7721], [8439, 6487, 775, 'G', 4257, 3999, 'r', 'd', 'n', 1547, 'o', 'i', 9283, '2635', 'j', '1093', 'j', '5033', 'x', '293', '553', '543', 'J', '1725', '601', 'x', '5281', '7091', '3753', 'o', '7627', 'o', 'T', '3225', 'q', 'k', 'o', 'N', 2513, 3813]
2635, j, 1093, j, 5033, x, 293, 553, 543, J, 1725, 601, x, 5281, 7091, 3753, o, 7627, o, T, 3225