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.

[4951, 4175, 's', 6005, 9551, 'O', 7357, 4795, 'a', 'h', 'c', 5783, 'k', 9537, 'V', 'b', '2305', '8523', 'K', 'O', 'Z', 'C', 'D', 'Y', 'd', '4495', 'J', 'q', 'x', 'l', 'W', 'O', 'l', 'v', 3579, 'g', 'i', 9361, 'o', 'D', 2879, 5889, 65, 'p', 'R', 6937, 6257], ['C', 6857, 'b', 'C', 9847, 'v', 'C', 3165, 7833, 'f', 5209, 9137, 'X', 8435, 'R', 'h', 'v', 3909, 'b', '2305', '8523', 'K', 'O', 'Z', 'C', 'D', 'Y', 'd', '4495', 'J', 'q', 'x', 'l', 'W', 'O', 'l', 'N', 1815, 'S', 'l', 'S', 631, 'F', 3349, 6489, 1515, 4695, 5211, 'r', 'Y', 1489]
Output:
b, 2305, 8523, K, O, Z, C, D, Y, d, 4495, J, q, x, l, W, O, l