Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['P', 'o', 1167, 'V', 'H', '9379', 'f', '7837', 'o', '7577', 'c', '6969', '3729', 'p', 'L', 'S', 9695, 9645, 'v'], [9985, 9615, 6829, 2907, '9379', 'f', '7837', 'o', '7577', 'c', '6969', '3729', 'p', 'N', 'Q', 3259, 'h', 9977, 'w', 'j', 'y']
Output:
9379, f, 7837, o, 7577, c, 6969, 3729, p