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

Input: Consider Input: ['P', 8059, 'A', 385, 't', 1999, 269, 'T', 'B', 'S', '5291', 'b', 'x', 'o', '7813', 'R', 'D', '1301', '2079', 'H', '3587', '1325', '8977', '5565', 'u', 'v', 'D', 'I', '6267', 'H', '6663', 'I', 'B', 'f', '2383', 'K', 6409, 'W', 'h', 9673, 1829, 'K', 'A'], [1099, 1609, 'q', 9603, 'B', 3251, 'o', 'x', 1197, 'O', 'u', 't', 'K', 'c', 1185, 'l', 'v', 'e', 'q', 9255, 'u', 'S', '5291', 'b', 'x', 'o', '7813', 'R', 'D', '1301', '2079', 'H', '3587', '1325', '8977', '5565', 'u', 'v', 'D', 'I', '6267', 'H', '6663', 'I', 'B', 'f', '2383', 'V', 6939]

Output: S, 5291, b, x, o, 7813, R, D, 1301, 2079, H, 3587, 1325, 8977, 5565, u, v, D, I, 6267, H, 6663, I, B, f, 2383

Input: Consider Input: [3043, 'd', 1055, '2909', 'J', 'D', '4735', '6701', 'v', 'P', '4341', '7905', 'G', '5297', '6721', 'Y', 'f', 4599], ['Q', 'X', 2931, 'f', 3139, 'r', 3625, 4375, 'B', 8381, '2909', 'J', 'D', '4735', '6701', 'v', 'P', '4341', '7905', 'G', '5297', '6721', 'N', 8281, 'W', 'u', 5969, 'w', 'b', 1735, 'j']

Output: 2909, J, D, 4735, 6701, v, P, 4341, 7905, G, 5297, 6721

Input: Consider Input: ['m', 3291, 9173, 9575, 6927, 'T', 4063, 5497, 6931, 2047, 3995, 'D', 'i', 'X', 'y', '4259', 'W', '3761', '5213', 'g', '5345', 'i', '8391', 'X', 'U', 'd', 'W', 'F', 'Q', 'r', 7753, 't', 939, 4069, 1683, 5995], [3781, 5749, 'H', 'u', 6101, 2641, 2769, 'v', 4501, 'F', 'm', 'n', 'D', 'i', 'X', 'y', '4259', 'W', '3761', '5213', 'g', '5345', 'i', '8391', 'X', 'U', 'd', 'W', 'M', 'q', 8007, 9645]
Output: D, i, X, y, 4259, W, 3761, 5213, g, 5345, i, 8391, X, U, d, W