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.

[3169, 7733, 3815, 'N', 4549, 'O', 6899, 'g', 4545, 'X', 'F', 'X', 'H', 'K', 'i', '3133', '8505', '9801', '3423', '5289', '6961', 'L', '6529', '6705', 't', 'l', 'F', 1651, 'k', 9301, 'N', 2193, 'P', 1639, 5405, 483, 'T'], [5275, 'F', 4429, 'T', 'p', 'c', 'G', 'H', 'c', 'a', 'H', 'K', 'i', '3133', '8505', '9801', '3423', '5289', '6961', 'L', '6529', '6705', 't', 'l', 'P', 5829, 4511, 1471, 2511, 2237, 'U', 8579, 7685, 2715]
Output:
H, K, i, 3133, 8505, 9801, 3423, 5289, 6961, L, 6529, 6705, t, l