Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [7849, 813, 1309, 3749, '10001', 'g', '1057', 'c', 't', 't', 'i', 2269, 'M', 'q', 373], ['d', 4077, 3209, 'g', 5643, '10001', 'g', '1057', 'c', 't', 't', 'h', 'Y', 8349, 'q', 3939, 1333]
Output:
10001, g, 1057, c, t, t