Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [1131, 693, 1239, '3935', 'v', '3223', '591', '6227', 'Z', '3571', 'f', '2335', 'J', 'F', 'V', 'p', 'X', '8363', 'X', '9895', '4417', '3237', 'I', 'Z', 3661, 'E', 'G', 6843, 4997, 269, 4011, 'U', 7631, 'D', 'F', 7757, 1961, 'H', 'H', 'Q', 'h', 'K', 'g'], [1395, 9279, 1263, 'S', 'y', '3935', 'v', '3223', '591', '6227', 'Z', '3571', 'f', '2335', 'J', 'F', 'V', 'p', 'X', '8363', 'X', '9895', '4417', '3237', 'I', 'G', 'j', 821, 6667, 'D', 'q', 'e', 2905, 7487, 1381]
Output:
3935, v, 3223, 591, 6227, Z, 3571, f, 2335, J, F, V, p, X, 8363, X, 9895, 4417, 3237, I