Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [2055, 'b', 5125, 4391, 'h', 8613, 'd', 7087, 'E', 'S', 'r', 'D', '3653', 'k', 'o', 'n', 'z', '5051', '3671', 't', 'j', 'Q', '2661', '1245', 'D', '1299', '5845', 'n', '6329', '2625', 'W', 'A', 'B', 't', 8723, 'd', 'r', 'k', 5217, 9991, 'Q', 6309, 665, 9585, 3333], [585, 2857, 'U', 1773, 6243, 'G', 2361, 6275, 4941, 4007, 1261, 4233, 'R', 'k', 'p', 3673, 1607, 'D', '3653', 'k', 'o', 'n', 'z', '5051', '3671', 't', 'j', 'Q', '2661', '1245', 'D', '1299', '5845', 'n', '6329', '2625', 'W', 'A', 'x', 'j', 'J', 'b', 3833, 7989, 7947, 2811, 'O', 2799, 4905, 'U', 5695, 5661, 5447, 8965, 'X', 'V']
Output:
D, 3653, k, o, n, z, 5051, 3671, t, j, Q, 2661, 1245, D, 1299, 5845, n, 6329, 2625, W, A