Given the task definition and input, reply with output. In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['S', 'M', 'W', 'i', 'I', 605], [1375, 'v', 'W', 'i', 'S', 3101]

W, i