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.

['f', 'D', 8781, 1153, 3255, 9893, 3295, 7561, 'W', 'u', 'L', 'b', 's', 'x', 'z', 'X', '4591', '5325', '7203', 'k', '1685', '6657', '8007', 'g', 'y', '9363', 'g', '6291', 'p', 'D', '4897', '8053', 'H', 'B', '2567', '6165', 't', '6091', 'w', 'V', 'i', 'b', 'a', 'r', 'u', 7439, 'h', 'f', 5629, 'O', 'x', 6813, 4813, 'f', 'U', 'W', 's', 7711, 'x', 'e', 'n', 4701, 3899], ['u', 8749, 'E', 1479, 'p', 9855, 5727, 7129, 7013, 'U', 'c', 'c', 'p', 'A', 8055, 9115, 8521, 9759, 9325, 'y', 'x', 'z', 'X', '4591', '5325', '7203', 'k', '1685', '6657', '8007', 'g', 'y', '9363', 'g', '6291', 'p', 'D', '4897', '8053', 'H', 'B', '2567', '6165', 't', '6091', 'w', 'V', 'i', 'b', 'G', 8127, 501, 'q', 'W']
Output:
x, z, X, 4591, 5325, 7203, k, 1685, 6657, 8007, g, y, 9363, g, 6291, p, D, 4897, 8053, H, B, 2567, 6165, t, 6091, w, V, i, b