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

Example Input: ['e', 'W', 'x', 6581, 'y', 4191, 'u', 'B', '6197', '6435', '4975', '5435', 'r', '7329', '4033', 'k', 'j', '5373', '5673', 'd', 'V'], ['i', 'O', 'Z', 211, 1503, 'X', 4315, 'G', 'u', 'B', '6197', '6435', '4975', '5435', 'r', '7329', '4033', 'k', 'j', '5373', '5673', 't', 'C']
Example Output: u, B, 6197, 6435, 4975, 5435, r, 7329, 4033, k, j, 5373, 5673

Example Input: ['B', 'r', 5629, 4409, 7197, 'N', 'x', 'I', '6145', 'i', 'Q', '1033', '2945', 'K', '4931', 'y', 6505, 9149, 'E', 3067, 819], [2523, 'f', 2623, 'I', '6145', 'i', 'Q', '1033', '2945', 'K', '4931', 'a', 5449, 9193, 6325, 'i', 6901, 'E']
Example Output: I, 6145, i, Q, 1033, 2945, K, 4931

Example Input: [7409, 'Z', 633, 987, 'Q', 9571, 'k', 5431, 'b', 'r', 'b', 'x', '5113', '7273', '1615', '7665', 'r', '3163', 'E', 't', 'j', 'D', 'M', 'B', 'W', '8633', '489', 'j', 'S', '5325', '8143', '8401', '9007', 'x', '907', '7447', 'd', '2255', '4555', 'K', 'a', 'p', 'r', 'g', 2639, 1415, 'B'], ['Q', 'K', 'i', 'K', 'P', 'q', 4287, 6059, 'l', 1331, 1727, 'E', 5375, 'Y', 'x', '5113', '7273', '1615', '7665', 'r', '3163', 'E', 't', 'j', 'D', 'M', 'B', 'W', '8633', '489', 'j', 'S', '5325', '8143', '8401', '9007', 'x', '907', '7447', 'd', '2255', '4555', 'K', 'a', 'G', 'w', 'W', 2961, 6441, 8455, 'r', 1179, 4147, 3255, 5631, 'H', 1725, 659]
Example Output:
x, 5113, 7273, 1615, 7665, r, 3163, E, t, j, D, M, B, W, 8633, 489, j, S, 5325, 8143, 8401, 9007, x, 907, 7447, d, 2255, 4555, K, a