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.

['E', 223, 3219, 71, 'U', 'E', '613', 'm', '7673', '875', '9607', '7655', 'y', '3243', '3721', '4313', '7815', '7973', '7043', 'q', 'F', 'T', 'J', '1201', 's', 1707, 4513, 'E', 'c', 't'], [5427, 6307, 1353, 6089, 9537, 'p', 'y', 'h', '613', 'm', '7673', '875', '9607', '7655', 'y', '3243', '3721', '4313', '7815', '7973', '7043', 'q', 'F', 'T', 'J', '1201', 'b', 5953, 't', 'v']
Output:
613, m, 7673, 875, 9607, 7655, y, 3243, 3721, 4313, 7815, 7973, 7043, q, F, T, J, 1201