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

Input: Consider Input: ['R', 't', 'y', '2887', 'x', 4883], [5691, 9457, 'y', '2887', 'u', 'Y']

Output: y, 2887


Input: Consider Input: ['L', 5499, 'z', 'J', 'I', 't', 6291], [337, 5087, 'z', 'J', 'I', 'p', 'm']

Output: z, J, I


Input: Consider Input: [3007, 9911, 'b', 2015, 'P', 'D', 'S', 91, 'G', 'Q', 'g', 'r', 'M', 'I', 'S', 3911, 'Q', 'i', 'd', '6005', 'B', 'g', '1179', '5719', 'L', 'E', 'b', 'c', 'a', 'E', 'n', 'R', '8111', 'A', '3377', 'Y', 2705, 't', 9889], ['l', 3713, 10005, 9299, 'i', 'V', 'v', 6969, 1775, 6541, 6827, 'S', 1677, 1181, 'C', 'i', 'd', '6005', 'B', 'g', '1179', '5719', 'L', 'E', 'b', 'c', 'a', 'E', 'n', 'R', '8111', 'A', '3377', 'p', 557]


Output: i, d, 6005, B, g, 1179, 5719, L, E, b, c, a, E, n, R, 8111, A, 3377