You will be given a definition of a task first, then some input of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

[1753, 'C', 4185, 5917, 1577, 3857, 975, 'P', '9125', '5127', 's', 'M', '317', '3259', 'G', 'm', 'n', '6545', '9133', 'b', 'c', 'i', 'l', 'S', 'y', 'X', 'h', '6555', '5653', '3085', '1921', '4213', 'r', '7107', 'd', 7727, 431, 8589], ['w', 'C', 3609, 'A', 7283, 'd', 'b', 'p', 'e', 'h', 'v', 4785, 5793, 5447, 'z', 1895, 'p', 'N', 5103, '9125', '5127', 's', 'M', '317', '3259', 'G', 'm', 'n', '6545', '9133', 'b', 'c', 'i', 'l', 'S', 'y', 'X', 'h', '6555', '5653', '3085', '1921', '4213', 'r', '7107', 'V', 'o', 'M', 'N', 7037, 'w', 'x', 's', 'C', 17, 2997, 'V', 825, 3961, 'i', 9687]
Output:
9125, 5127, s, M, 317, 3259, G, m, n, 6545, 9133, b, c, i, l, S, y, X, h, 6555, 5653, 3085, 1921, 4213, r, 7107