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.

['M', 'N', 'b', 'R', 7527, 5585, 'o', 'F', 'S', '8167', '9589', 'w', '6907', 'f', '5353', 'B', 'U', 'l', '4105', '2801', '1505', 'M', '509', '921', 'D', 'm', 4389, 'l', 9187, 'J'], ['W', 'e', 'O', 'o', 'F', 8411, '8167', '9589', 'w', '6907', 'f', '5353', 'B', 'U', 'l', '4105', '2801', '1505', 'M', '509', '921', 'D', 'G', 5917, 3083, 'e', 8737, 8661, 4147, 'v', 8317, 'C', 5985, 919, 'u', 'y']
Output:
8167, 9589, w, 6907, f, 5353, B, U, l, 4105, 2801, 1505, M, 509, 921, D