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.

[4961, 9299, 3799, 'U', 'w', 'I', 8343, 7787, 7545, 'k', 3031, 7605, 5501, 'n', 's', 545, 'r', 'Y', 2125, 5673, 'V', 303, 4701, 'j', '7435', '5871', '4337', 'l', 'q', '2329', 'N', '2283', '6307', 'R', 'm', '7539', 'e', 'y', 'i', '5127', 'd', '2395', '2733', '2857', '2773', '2883', 'E', 9183, 8227, 1737, 'n', 'Q', 2271, 7697, 'S', 'o', 8739, 'b', 'J'], [6137, 6615, 'h', 2941, 9655, 6997, 8009, 'j', 4217, 'j', '7435', '5871', '4337', 'l', 'q', '2329', 'N', '2283', '6307', 'R', 'm', '7539', 'e', 'y', 'i', '5127', 'd', '2395', '2733', '2857', '2773', '2883', 'd', 'N', 5037, 6515]
Output:
j, 7435, 5871, 4337, l, q, 2329, N, 2283, 6307, R, m, 7539, e, y, i, 5127, d, 2395, 2733, 2857, 2773, 2883