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.

[6769, 3107, 7113, 'I', '4825', 'O', 'o', '9827', '361', '3519', '975', '6069', 'P', '5237', 'h', '2669', 'P', 3761, 7841], ['k', 'H', 9899, 'j', 'o', 893, 'A', 'K', 'Q', 1019, 3403, 'I', '4825', 'O', 'o', '9827', '361', '3519', '975', '6069', 'P', '5237', 'h', '2669', 'Y', 'R', 3549, 485, 2627, 'B', 6439, 'Q']
Output:
I, 4825, O, o, 9827, 361, 3519, 975, 6069, P, 5237, h, 2669