Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['r', 'i', 7417, 'o', 'b', 'M', 7257, 5731, 'c', 7549, 1403, 'M', 'Q', 9231, 'P', 'r', 7255, 'p', 'b', '6985', 'w', '4929', '9215', 'd', 'H', 'a', 'q', '8991', '6211', 't', '7111', '6231', 'D', '3439', 'J', 'P', '9441', '9665', 'i', 'f', 'M', 9191, 1749, 'i', 2429, 3177, 'U', 765, 'u', 's', 9217, 10015, 'A', 4069, 'U'], ['B', 'N', 5841, 2569, 'E', 'b', '6985', 'w', '4929', '9215', 'd', 'H', 'a', 'q', '8991', '6211', 't', '7111', '6231', 'D', '3439', 'J', 'P', '9441', '9665', 'i', 'M', 'O', 6425, 3373, 3825, 5719, 721, 'C', 4617, 'n', 'u', 'J', 'S', 'j']
Output:
b, 6985, w, 4929, 9215, d, H, a, q, 8991, 6211, t, 7111, 6231, D, 3439, J, P, 9441, 9665, i