Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [9475, 'k', 'r', 9597, 5761, 'B', 'v', '543', 'M', '9807', '7001', '7261', 'r', 'm', '5447', 'r', '2223', 'U', '3235', '9375', '1293', '375', 'H', '6719', 'n', 'V', 'l', 'b', 5715, 'x', 6569, 'N', 9421, 'D', 'Q', 'i', 161, 'F', 9073, 2635, 'A', 5371, 6989, 9287, 5405, 'T', 'V', 1875], [2255, 6857, 5433, 'z', 3491, 6883, 's', 'P', 'v', '543', 'M', '9807', '7001', '7261', 'r', 'm', '5447', 'r', '2223', 'U', '3235', '9375', '1293', '375', 'H', '6719', 'n', 'V', 'l', 'S', 'j', 9143, 'q', 3049, 3153, 'z', 167, 5151, 3315, 9045, 'R', 6267, 'k', 'w', 2869, 8389, 9513, 4293]
Output:
v, 543, M, 9807, 7001, 7261, r, m, 5447, r, 2223, U, 3235, 9375, 1293, 375, H, 6719, n, V, l