You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

[5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Solution: 8297, b
Why? 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'].

New input: ['f', 1189, 713, 3071, 'Q', 4451, 8021, 7289, 3821, 5247, 4363, 'R', 1331, 2967, 'Y', 8307, 'j', 'Y', 'W', 'g', 'S', 'n', '8227', 'e', '2371', '3049', '943', 'l', '3395', 'Z', '6277', 'j', '3261', '563', 'd', '1881', '1005', '8887', '9115', '4829', '7001', '1219', '5415', '7209', '1427', 'n', 's', 6257, 8949, 'J', 5587, 't', 'i', 6619, 'v', 'K', 'B', 3673, 'g', 3927, 'E', 't', 'i', 'H', 'v', 5529, 'Z', 8703, 1241], ['k', 'C', 'h', 'E', 'w', 't', 'T', 'z', 'E', 'h', 5649, 3121, 9779, 4365, 'x', 6571, 'f', 'G', 3327, 'W', 6067, 'p', 'D', 'n', '8227', 'e', '2371', '3049', '943', 'l', '3395', 'Z', '6277', 'j', '3261', '563', 'd', '1881', '1005', '8887', '9115', '4829', '7001', '1219', '5415', '7209', '1427', 'n', 'E', 'X', 1809, 3703, 'c', 3607, 103, 'x', 869, 'v', 'C', 4421, 3593, 9133, 'Y', 'o', 'Q', 8797, 8693, 1729, 8813, 'Q', 'u', 2917, 379]
Solution:
n, 8227, e, 2371, 3049, 943, l, 3395, Z, 6277, j, 3261, 563, d, 1881, 1005, 8887, 9115, 4829, 7001, 1219, 5415, 7209, 1427, n