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.

['l', 8391, 7237, 'j', 5061, '1867', 'R', '5053', 'H', 'R', 'd', 'K', 8013, 'H'], ['H', 7623, '1867', 'R', '5053', 'H', 'R', 'd', 'e', 3679, 'd', 'M', 'j']
Output:
1867, R, 5053, H, R, d