Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [4799, 5047, 6847, 'K', 'j', 1299, 4423, 3125, 2979, 's', 'S', 7695, 'j', 9437, 'V', 'E', 'o', 'D', '991', 'm', 'o', 'm', '825', '1705', '5539', 'f', '2633', 'v', '7533', 'U', 'b', 'Y', 'G', 'A', 'i', 'X', 'r', 'k', 'n', 'V', 'N', 'r', 'q'], [4111, 'f', 'Y', 4589, 3317, 'U', 'm', 'G', 7447, 4255, 'g', 'K', 'E', 'o', 'D', '991', 'm', 'o', 'm', '825', '1705', '5539', 'f', '2633', 'v', '7533', 'U', 'b', 'Y', 'G', 'A', 'i', 'a', 5637, 5241, 'J', 4283, 'l', 'q', 1929, 3969, 1287, 325, 'd', 'V', 51, 'S']
Output:
E, o, D, 991, m, o, m, 825, 1705, 5539, f, 2633, v, 7533, U, b, Y, G, A, i