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.

[8417, 'J', 675, 't', 'd', '9977', '9341', '5715', 'N', '7735', 'n', 'm', 'b', 'Y', '681', 't', 't', 'G', 't', 'A', 't', 'k', '1105', '9013', '5041', '7333', '9965', '2591', '629', 'a', 'q', 3641, 3353, 6689, 'D', 5333, 'H', 8487], ['x', 'N', 'y', 8467, 'z', 2977, 's', 'd', 4721, 'c', 'n', 5729, 'K', 'h', 1263, 'F', 1093, '9977', '9341', '5715', 'N', '7735', 'n', 'm', 'b', 'Y', '681', 't', 't', 'G', 't', 'A', 't', 'k', '1105', '9013', '5041', '7333', '9965', '2591', '629', 'a', 'f', 'i', 'y']
9977, 9341, 5715, N, 7735, n, m, b, Y, 681, t, t, G, t, A, t, k, 1105, 9013, 5041, 7333, 9965, 2591, 629, a