In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Input: Consider Input: [4601, 2349, 'b', 'b', 'o', 'd', 'D', 'M', 'P', '3119', 's', '9507', 'u', 7239, 'o', 5437, 5729, 3109], [2629, 9653, 7873, 'T', 6873, 2939, 'o', 'd', 'D', 'M', 'P', '3119', 's', '9507', 'w', 'G']

Output: o, d, D, M, P, 3119, s, 9507


Input: Consider Input: [2787, 'N', 'I', 'M', 'x', '3825', 'r', '1041', 'y', 'a', 'v', 6057], ['F', 6523, 'x', '3825', 'r', '1041', 's', 'C', 3001, 8425]

Output: x, 3825, r, 1041


Input: Consider 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