In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
One example: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
Solution is here: 8297, b
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'].

Now, solve this: ['h', 5819, 'h', '5745', 'o', '1133', '5479', 'S', '6581', 'T', '2001', 'H', 1387, 'w', 3353, 2643, 'Y', 2281, 's', 2471], ['s', 9997, 2917, 'p', 'H', 'Y', 10007, 6287, 'h', '5745', 'o', '1133', '5479', 'S', '6581', 'T', '2001', 'F', 9497, 'S', 'P', 's', 'r']
Solution:
h, 5745, o, 1133, 5479, S, 6581, T, 2001