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.

['s', 2705, 7909, 4031, 4293, 'Z', 4345, 7655, 1349, 'A', 589, 'F', 'd', 'K', 'm', '939', '3279', 'N', '119', 'Y', '4537', 'C', '1281', '9095', 'D', '7379', '7953', '4783', '827', 'v', '9503', 'X', '4557', 'z', '3527', 'd', '7279', 'b', 'P', 6833, 4027, 1295, 5957, 'B', 'u', 'h', 5903, 'f', 'Q', 'R', 9443, 1699, 211, 'v', 'm', 'J'], [8825, 'T', 'K', 'm', '939', '3279', 'N', '119', 'Y', '4537', 'C', '1281', '9095', 'D', '7379', '7953', '4783', '827', 'v', '9503', 'X', '4557', 'z', '3527', 'd', '7279', 'r', 'S', 9223, 'L', 't', 'g', 'B', 'r', 'M', 6179, 4007, 9581, 2227, 'S']
Output:
K, m, 939, 3279, N, 119, Y, 4537, C, 1281, 9095, D, 7379, 7953, 4783, 827, v, 9503, X, 4557, z, 3527, d, 7279