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.

['B', 5237, 'v', 7059, 2083, 't', 'a', 9827, 'I', 'R', 2659, 3569, 'a', 'H', 'H', 1387, 'd', 'l', 'w', 'c', 'v', 'B', '6937', 'l', 'E', 'f', '3933', '5743', '1849', '2229', '1869', '6599', 'D', 'm', 'Z', '8065', 'q', 'N', '9665', 'I', '8945', '6341', 'K', 'O', '9365', 'C', 'N', 'u', 'v', 9753, 8687, 'z', 6919, 's', 7443, 'J', 7961, 'j', 8577, 8029, 6285, 4165, 'h', 's', 'G', 'A', 871, 'N', 3239, 5797, 8773, 1799, 3743], ['Z', 4259, 6169, 'U', 'e', 'F', 7487, 7125, 'z', 'a', 'p', 'z', 1971, 'n', 1979, 9461, 'A', 'G', 1299, 2563, 7507, 7525, 'L', 1761, 2369, 'F', 's', 2785, 'l', 'w', 'c', 'v', 'B', '6937', 'l', 'E', 'f', '3933', '5743', '1849', '2229', '1869', '6599', 'D', 'm', 'Z', '8065', 'q', 'N', '9665', 'I', '8945', '6341', 'K', 'O', '9365', 'J', 827, 'x', 3091, 'T', 't', 'm', 'g', 'y', 9359, 719, 10025, 's', 'U', 'm', 9667, 1383, 8599, 8477, 9711, 'm']
Output:
l, w, c, v, B, 6937, l, E, f, 3933, 5743, 1849, 2229, 1869, 6599, D, m, Z, 8065, q, N, 9665, I, 8945, 6341, K, O, 9365