Given the task definition and input, reply with output. In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['Y', 'n', 85, 371, 's', 5333, 19, 't', 'i', 'O', '9789', 'z', '543', 'T', '7151', 'r', 'a', 'Z', 'G', '1305', 'v', '335', 'z', 'S', 'P', 't', 's', '1387', 'x', 'o', 'X', 'g', 'Q', 'N', 'l', 3797, 'o', 45, 9815, 1917, 1951, 5057, 999, 9869, 'P', 'g', 'T'], ['y', 3069, 8061, 7865, 'X', 2881, 1865, 611, 7901, 'r', 'l', 'N', 6469, 6149, 2353, 'o', 1453, 'D', 'W', 'r', 'O', '9789', 'z', '543', 'T', '7151', 'r', 'a', 'Z', 'G', '1305', 'v', '335', 'z', 'S', 'P', 't', 's', '1387', 'x', 'v', 'C', 'a', 'D', 'o', 'Q', 7485, 'u', 'D', 1105, 7839, 7095]
O, 9789, z, 543, T, 7151, r, a, Z, G, 1305, v, 335, z, S, P, t, s, 1387, x