Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [2861, 'S', 'U', '9039', 'J', 1571], [8599, 's', 'U', '9039', 'Z', 't']
Output:
U, 9039