In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Input: Consider Input: ['k', 'l', 3761, 9679, 'Y', 'l', '1953', '7925', '8115', '5243', 'Y', '3939', '1231', 'Q', 'u', 5953, 5571, 'N'], [8981, 8379, 'h', 9701, 759, 'd', '1953', '7925', '8115', '5243', 'Y', '3939', '1231', 'l', 5705, 'P', 4009, 1189]

Output: 1953, 7925, 8115, 5243, Y, 3939, 1231


Input: Consider 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


Input: Consider Input: ['y', 'B', 'h', 'y', '3481', 'b', 'B', 'Y', 6857, 3143], ['i', 'n', 8463, 'h', 'y', '3481', 'b', 'N', 367, 'o']


Output: h, y, 3481, b