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

Input: Consider Input: [8769, 8805, 'W', 'a', 'l', '9061', 'b', 'A', 'D'], [3199, 'o', 'm', 'a', 'l', '9061', 'b', 'v', 'g']

Output: a, l, 9061, b


Input: Consider Input: [8471, 8309, 'g', 'f', 5019, 'd', 8129, 'r', 'e', 'l', 'B', '7297', 'c', '2785', '919', 'B', '5459', 'L', 5985, 2953, 6897, 'n', 9209, 3281, 'w', 4011, 't'], ['g', 7529, 'q', 6213, 'c', 'l', 6053, 'r', 'e', 'l', 'B', '7297', 'c', '2785', '919', 'B', '5459', 'B', 2159, 7633, 8707]

Output: r, e, l, B, 7297, c, 2785, 919, B, 5459


Input: Consider Input: [5653, 1229, 4183, 'g', '5605', '7613', 'J', 'g', 'K', 'O', 'o', 'A', 7931], ['c', 'J', 4579, 4879, '5605', '7613', 'J', 'g', 'K', 'O', 'W', 'L', 'C', 7311, 'Y', 'Q']


Output: 5605, 7613, J, g, K, O