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.

[1381, 535, '8057', 'G', '4879', '121', '5241', 'W', '2389', 'd', '593', 'r', 'w', 'U', '5795', '6619', '3181', '9709', 'I', '9699', 'W', 'J', '4827', 'r', 'e', 'J', 9427, 'I', 6171, 3609, 7379, 'z', 2585, 'J', 'Z'], ['g', 'o', 329, 1063, 6187, 8891, 'W', 3087, 9947, 'K', 8769, 'M', 'g', 6037, 'x', 3197, 'u', 8669, 4851, '8057', 'G', '4879', '121', '5241', 'W', '2389', 'd', '593', 'r', 'w', 'U', '5795', '6619', '3181', '9709', 'I', '9699', 'W', 'J', '4827', 'r', 'x', 7663, 8023, 1411, 'v', 3705]
Output:
8057, G, 4879, 121, 5241, W, 2389, d, 593, r, w, U, 5795, 6619, 3181, 9709, I, 9699, W, J, 4827, r