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.

['D', 2095, 'z', 'd', 5201, 8961, 'H', 7415, 'w', 'h', 'm', 9939, 'p', 'S', 2225, 'x', 4683, 'h', 'j', '6133', 'J', 'w', '4091', 'i', 'Y', '4067', '9915', '6101', '6439', 'o', '4991', '3015', 'l', 'a', 'C', '4733', 'H', '899', 'Y', 2227, 1823, 9153, 2525, 9947, 'E', 2935, 433, 'b', 3643, 'Z', 9991, 6315, 3555, 'k'], ['I', 'b', 4129, 6177, 'm', 'J', 5141, 69, 4527, 'j', '6133', 'J', 'w', '4091', 'i', 'Y', '4067', '9915', '6101', '6439', 'o', '4991', '3015', 'l', 'a', 'C', '4733', 'H', '899', 'w', 497, 197, 6747]
Output:
j, 6133, J, w, 4091, i, Y, 4067, 9915, 6101, 6439, o, 4991, 3015, l, a, C, 4733, H, 899