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.

['Y', 4039, 9081, '4359', 'h', 'k', '9313', 'a', '4029', 'k', '4449', 'C', '2235', 'o', '9045', 'u', 9745, 'G', 'T', 1209, 'U', 1609, 'F', 'V', 7295, 6141, 7895], ['q', 'v', 675, 8083, 105, 7017, 2857, 'D', 6985, 9577, 5647, 'C', '4359', 'h', 'k', '9313', 'a', '4029', 'k', '4449', 'C', '2235', 'o', '9045', 'v', 'l', 'y', 'G', 1253, 1755]
Output:
4359, h, k, 9313, a, 4029, k, 4449, C, 2235, o, 9045