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: [1141, 637, 5583, 'H', 8655, 'G', 'Q', 'A', 'd', 'M', 'H', 'Z', 'O', 'Y', 'a', 'u', 'H', '7641', '4969', '7495', '527', 't', '31', '5853', '9811', 'n', '5095', 'w', 'e', 7979, 5027, 1667, 3795, 9115, 7247, 'A', 'X', 'p', 'R', 9795, 'c', 1635], [5279, 'D', 4301, 3687, 'W', 7237, 1847, 1669, 'D', 6583, 'E', 4643, 7495, 2773, 9975, 'H', 'Z', 'O', 'Y', 'a', 'u', 'H', '7641', '4969', '7495', '527', 't', '31', '5853', '9811', 'n', '5095', 'p', 'w', 'x', 9441]
A:
H, Z, O, Y, a, u, H, 7641, 4969, 7495, 527, t, 31, 5853, 9811, n, 5095