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.

[4441, 9295, 9549, 6505, 'D', 2079, 7005, 'H', 1825, 7709, 407, 'l', 'S', '473', 's', '8339', '9919', 'W', 'W', '7189', 'J', '5447', '8917', 's', 'f', 'U', 303, 4153, 'h', 10011, 4819, 1303, 'U', 'I', 't', 'p', 3053], ['E', 'R', 7489, 5421, 'd', 'l', 'S', '473', 's', '8339', '9919', 'W', 'W', '7189', 'J', '5447', '8917', 's', 'S', 857, 8877, 'h', 1741, 4117, 6411, 'W', 'c', 'Q', 2897]
Output:
l, S, 473, s, 8339, 9919, W, W, 7189, J, 5447, 8917, s