In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Example input: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Example output: 8297, b
Example explanation: 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: ['S', 'w', 'E', 3359, 'l', 7773, 3373, 6883, 161, 'j', 2733, 'A', 9931, 'P', 'f', 4041, 9635, 't', 3337, 'g', 'y', 4115, 'd', 'm', 'A', 5375, '2777', '1123', '8269', 'y', 'Y', 'n', '6231', 'y', 'r', '1963', 'n', 'b', '479', 'p', '8577', 'y', 't', '1579', '6411', '4351', 'y', 'D', '9721', '1101', 'H', '8911', 'P', '7737', 'I', 'm', 'v', 6319, 'L', 'D', 't', 'O', 'v', 3713, 'c'], [4301, 'D', 'z', 2399, 'z', 'x', 'w', 6249, 'w', 'j', 'O', 109, 'G', 2319, 'G', 5813, '2777', '1123', '8269', 'y', 'Y', 'n', '6231', 'y', 'r', '1963', 'n', 'b', '479', 'p', '8577', 'y', 't', '1579', '6411', '4351', 'y', 'D', '9721', '1101', 'H', '8911', 'P', '7737', 'I', 'p', 'S', 1111, 5095, 'r', 'E', 517, 3983, 'O', 5123, 3981, 5591, 'G', 'Y', 8325, 9109, 9027, 6135, 2747, 9251, 1329, 9259, 4693, 575, 6679, 2763, 'W', 'V']
A:
2777, 1123, 8269, y, Y, n, 6231, y, r, 1963, n, b, 479, p, 8577, y, t, 1579, 6411, 4351, y, D, 9721, 1101, H, 8911, P, 7737, I