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

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: ['f', 8855, 'N', 8821, 10001, 6833, 'R', 'I', 1167, 87, 'Y', 'H', 673, '4021', 'S', '3407', 'z', '895', 'j', '9897', 'U', '3747', 'S', 'p', 'v', 'y', 'c', 'd', 'U', 143, 'k', 9757, 943, 'C', 'q', 'u', 'n', 1545, 941], ['T', 7625, 'Y', 'j', 'O', 3075, '4021', 'S', '3407', 'z', '895', 'j', '9897', 'U', '3747', 'S', 'p', 'v', 'y', 'v', 'D', 'g', 'o', 'O', 2255, 'a', 5303, 569, 5721, 'S', 5411, 'E']

Output: 4021, S, 3407, z, 895, j, 9897, U, 3747, S, p, v, y


Input: Consider Input: [7621, 2469, 's', 'i', 'x', 'b', 'k', 'h'], [6629, 'F', 'R', 'm', 's', 'i', 'x', 'b', 'f', 'w']


Output: s, i, x, b