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.

[4527, 3679, 4929, 1049, 5207, 9937, 6161, 7335, 9951, 'r', 3389, 6375, 897, 'j', 4295, 4055, 9235, 'f', 7429, 4823, '8367', '3313', '1817', '9467', 'K', 'N', 'i', '2813', '6371', 'D', '8419', 'n', 'G', '10017', '7847', 'R', '1377', '6555', '7193', 'n', '9823', 'j', 'F', 'J', 511, 'B', 9271, 9287, 'q', 4693, 'I', 'p', 2571, 6611, 7189, 9057, 2133, 'q', 5917, 5289], ['o', 5837, 'r', 9811, 'v', 2519, 3017, 4175, 'D', 2503, 7003, 'A', 2569, 'p', 6499, '8367', '3313', '1817', '9467', 'K', 'N', 'i', '2813', '6371', 'D', '8419', 'n', 'G', '10017', '7847', 'R', '1377', '6555', '7193', 'n', '9823', 'j', 'z', 5595, 'Q', 't', 3945, 4927, 9609, 'b', 1577, 9675, 'O']
Output:
8367, 3313, 1817, 9467, K, N, i, 2813, 6371, D, 8419, n, G, 10017, 7847, R, 1377, 6555, 7193, n, 9823, j