In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
One example is below.
Q: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
A: 8297, b
Rationale: Here, '8297, b' is the longest common subsequence in both the input lists [5797, 8817, '8297', 'b', 'U', 'b'] and [5843, 8809, '8297', 'b', 'W', 'C'].
Q: ['C', 'b', 'L', 9325, 'M', 'p', 7813, 'J', '1879', 'l', '6011', '8425', '5761', '8567', '529', '3079', '2611', '9387', '909', '751', 'Q', 4393, 'x', 5071, 6297], [347, 'W', 8317, 'm', 655, 2215, 9489, 9125, 7317, 'J', '1879', 'l', '6011', '8425', '5761', '8567', '529', '3079', '2611', '9387', '909', '751', 'L', 6565, 5537, 'C', 'S', 543, 5541, 'Z', 'q', 'W', 8259, 9311]
A:
J, 1879, l, 6011, 8425, 5761, 8567, 529, 3079, 2611, 9387, 909, 751