Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [5883, 4579, 'j', 'I', '6687', 'G', '6933', '291', 'D', 3709], ['Z', 617, '6687', 'G', '6933', '291', 'o', 'n']
Output:
6687, G, 6933, 291