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.

[4351, 7431, 9011, 'z', 'W', 'j', '3589', '8471', 'O', '5949', '4621', '7963', '7073', 'm', 'h', '6997', '515', 'S', '4543', 'E', '8089', 'U', '8891', 'j', 'e', 1201, 'X'], ['h', 'v', 'p', 5643, 't', 9579, 3589, 'b', 9213, 'Y', 'V', 1087, 'z', 'W', 'j', '3589', '8471', 'O', '5949', '4621', '7963', '7073', 'm', 'h', '6997', '515', 'S', '4543', 'E', '8089', 'U', '8891', 'H', 'w', 8743, 'F', 'Y', 3803, 8951, 'w', 2077, 9835, 3277]
Output:
z, W, j, 3589, 8471, O, 5949, 4621, 7963, 7073, m, h, 6997, 515, S, 4543, E, 8089, U, 8891