Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [1167, 9109, 8959, 'G', 'q', 'K', '9381', 'v', 'G', 1879, 2359], ['V', 6937, 279, 'G', 'q', 'K', '9381', 'o', 'J', 9799]
Output:
G, q, K, 9381