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.

[573, 1099, 7855, 2721, 'S', '4239', 'S', '1413', '2637', '7927', '81', 'k', '617', '7911', 'r', 'z', '8063', '4831', '2073', 'O', '767', '3301', '495', 'd', '7379', 'l', 'G', 'F', 'O', 'z', 'W', 4853, 3035, 'j', 'm', 1337, 8717, 3417, 1649, 7785, 2309], [9707, 'L', '4239', 'S', '1413', '2637', '7927', '81', 'k', '617', '7911', 'r', 'z', '8063', '4831', '2073', 'O', '767', '3301', '495', 'd', '7379', 'u', 'f', 4681, 8423, 'h', 'w', 5959, 6847, 'L', 'u', 9117, 6411]
Output:
4239, S, 1413, 2637, 7927, 81, k, 617, 7911, r, z, 8063, 4831, 2073, O, 767, 3301, 495, d, 7379