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.

[1113, 'F', 'z', 8905, 7469, 9571, 4621, 'v', 'X', 'z', 9833, 'N', 4627, 7693, 1593, 'L', 6517, 'c', 3687, 'R', '8673', '8497', '479', 'g', 'U', '4571', '7223', 'Q', '8439', 'a', '6203', '2085', 'p', 'x', '1545', 'c', '5583', 'M', 'q', '535', '7279', 'Y', 'X', 8075, 'P', 'Q', 'I', 'B', 3245, 'q', 6339, 'B', 'Y', 'n', 9687, 'i', 5295, 'g', 1113, 1387, 4217, 'Y', 'h'], [3525, 'T', 't', 5927, 'R', '8673', '8497', '479', 'g', 'U', '4571', '7223', 'Q', '8439', 'a', '6203', '2085', 'p', 'x', '1545', 'c', '5583', 'M', 'q', '535', '7279', 'j', 6169, 7661]
Output:
R, 8673, 8497, 479, g, U, 4571, 7223, Q, 8439, a, 6203, 2085, p, x, 1545, c, 5583, M, q, 535, 7279