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.

['i', 9693, 8685, 6717, 135, 'U', 'y', 'b', 'U', 'R', 9893, 439, 3515, 595, 4421, '2977', '2635', 'w', '555', '3249', 't', '4993', '1329', 'e', 'C', '1413', '8705', '5423', 'P', 'q', '4077', 'q', 'Z', 5615, 4917, 'c', 'T', 'd', 2895, 'Z', 8009], [3773, 'Y', 'W', 'c', '2977', '2635', 'w', '555', '3249', 't', '4993', '1329', 'e', 'C', '1413', '8705', '5423', 'P', 'q', '4077', 'q', 'A', 2087, 8731, 1071, 4205, 769, 6895, 4897, 1207, 2155, 1529, 4027, 8217, 'Z', 6595, 1831, 'H']
Output:
2977, 2635, w, 555, 3249, t, 4993, 1329, e, C, 1413, 8705, 5423, P, q, 4077, q