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: [3563, 6167, 211, 2581, 9893, 'A', 'f', '5595', '5775', 'W', 'J', 'J', 'I', '9687', '5801', '1637', 'a', 'M', 'w', 'B', 'o', 'm', 8275], ['f', 8629, 'I', 'l', '5595', '5775', 'W', 'J', 'J', 'I', '9687', '5801', '1637', 'a', 'M', 'w', 'B', 'k', 'y', 'V']
A:
5595, 5775, W, J, J, I, 9687, 5801, 1637, a, M, w, B