In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Example Input: ['E', 'e', 'C', 'k', 5673, 2461, 'd', 'g', '1699', '8221', 'a', 'L', 'h', 'u', 'c', '2485', 'D', '5387', 'O', 'H', 'R', '6189', '539', 'T', 'J', '5461', '3691', 'd', '3389', '8315', 'Z', 'b', '5401', 'g', 7959, 9915, 9195, 8581], ['I', 'r', 'P', 'v', 'd', 'g', '1699', '8221', 'a', 'L', 'h', 'u', 'c', '2485', 'D', '5387', 'O', 'H', 'R', '6189', '539', 'T', 'J', '5461', '3691', 'd', '3389', '8315', 'Z', 'b', '5401', 'S', 't', 2069, 1067, 9577, 6283, 1527, 'l', 'X', 'L', 5625, 9857, 8631, 'S', 'e']
Example Output: d, g, 1699, 8221, a, L, h, u, c, 2485, D, 5387, O, H, R, 6189, 539, T, J, 5461, 3691, d, 3389, 8315, Z, b, 5401

Example Input: ['s', 'J', 2223, 'y', 'v', '9315', '8837', 'z', '8583', 'o', 'c', 'V'], ['E', 5699, 1225, 'f', '9315', '8837', 'z', '8583', 'o', 'u', 'j']
Example Output: 9315, 8837, z, 8583, o

Example Input: [2293, 4301, 1125, 7041, 7099, 8215, 7187, 4929, 8689, 8725, 'A', 4301, 'v', 1699, 'q', 'N', '1391', 'O', '5531', 'W', 'v', 'm', 'c', '2199', '7201', '383', '7913', 'U', '9941', '2571', 'X', 8261, 3775, 'O', 'q', 9299, 3705, 4733, 'Y', 5119, 5925, 237, 'W', 't'], [5055, 'C', 'W', 'q', 'N', '1391', 'O', '5531', 'W', 'v', 'm', 'c', '2199', '7201', '383', '7913', 'U', '9941', '2571', 'r', 'P', 6563, 2105, 4759, 'g', 2325]
Example Output:
q, N, 1391, O, 5531, W, v, m, c, 2199, 7201, 383, 7913, U, 9941, 2571