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: [3813, 7207, 6441, 10003, 'd', 'w', 'J', 'K', '6419', '8911', '935', 'Q', '1789', '8205', 'a', 'P', '9703', 'p', 'u', 9321, 1249, 683, 8093, 4857, 4367, 'G', 4057, 'e', 'P'], ['F', 739, 'a', 2583, 8547, 'p', 'd', 'w', 'J', 'K', '6419', '8911', '935', 'Q', '1789', '8205', 'a', 'P', '9703', 'M', 'j', 131, 8005, 'C', 'M', 'Z', 8819, 1283, 'M', 3551, 7539]
A:
d, w, J, K, 6419, 8911, 935, Q, 1789, 8205, a, P, 9703