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

Example Input: [7667, 'U', 5597, 9391, 'm', 'F', 683, 'k', 'r', 'm', 4389, 'X', 'p', 39, 'E', '8801', 't', 'B', 'V', 'v', 'e', 'p', '9493', '4805', 'n', 'V', 'C', '4657', '6173', '3989', '9599', 'U', 'r', 's', '5255', '5265', 'r', 8425, 2993, 'e', 6063, 9811, 'P', 7403], [3191, 'S', 'b', 'F', 'B', 'Z', 'i', 'A', 1703, 'q', 3449, 'Q', 'X', 'f', 'k', 4455, 'L', '8801', 't', 'B', 'V', 'v', 'e', 'p', '9493', '4805', 'n', 'V', 'C', '4657', '6173', '3989', '9599', 'U', 'r', 's', '5255', '5265', 'F', 'b', 6335, 615, 6181, 'K', 'U', 'F', 'a', 7617, 'F', 'W', 'N', 'Z', 8971, 'h', 9081, 'h', 4427, 'j']
Example Output: 8801, t, B, V, v, e, p, 9493, 4805, n, V, C, 4657, 6173, 3989, 9599, U, r, s, 5255, 5265

Example Input: ['p', 9773, 'Y', 'o', 'w', 's', '583', 'e', '2773', '9925', '8535', 'M', '9831', 'V', 'q', 'S', 5087, 'M', 7601, 'D'], [7787, 'l', 'o', 'w', 's', '583', 'e', '2773', '9925', '8535', 'M', '9831', 'V', 'q', 'X', 'W', 3163, 'f', 5201]
Example Output: o, w, s, 583, e, 2773, 9925, 8535, M, 9831, V, q

Example Input: ['G', 9065, 'q', 'o', 'd', 'p', 'i', '6923', 'G', 'S', 'Q', '9083', '3087', '3997', '4871', '2207', '2009', 'M', 'M', 'y', 's'], ['Z', 1701, 'J', 9419, 'v', 'p', 'i', '6923', 'G', 'S', 'Q', '9083', '3087', '3997', '4871', '2207', '2009', 'M', 'G', 9963, 8991, 'U', 1, 8157]
Example Output:
p, i, 6923, G, S, Q, 9083, 3087, 3997, 4871, 2207, 2009, M