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: [2809, 't', 'N', 'u', 'q', 8883, 'E', 'F', 'h', 'O', '1255', 'C', 'o', '7565', '3507', 'W', 'D', 'i', 'R', '7943', 'B', 'm', 6161, 3459, 5513, 7241, 'm', 'm', 'l'], [4019, 9055, 5153, 'F', 'Q', 237, 'O', 4279, 'p', 'N', 'O', '1255', 'C', 'o', '7565', '3507', 'W', 'D', 'i', 'R', '7943', 'w', 8005]
A:
O, 1255, C, o, 7565, 3507, W, D, i, R, 7943