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

Example Input: [2945, 6951, 2771, 'k', 'G', '7377', 'd', 'a', 'p', 'J', 'c', 'R', '6641', 'a', '2235', '3033', '3189', '7299', 'h', 'T', '5111', 'k', 'd', 4197, 'j', 'p', 'z', 1911, 'w', 6663, 7993, 5973, 3193, 7387, 'h', 'e', 8663, 2715], ['U', 'a', 'f', 7179, 7859, 'C', 6081, 2069, 3459, 'm', 'w', 'k', 'q', 'k', 'G', '7377', 'd', 'a', 'p', 'J', 'c', 'R', '6641', 'a', '2235', '3033', '3189', '7299', 'h', 'T', '5111', 'k', 'e', 'v', 'f', 5943, 8771, 'K', 'i', 'c', 'x', 7745, 'F', 'x', 3855, 'S', 5113, 1205]
Example Output: k, G, 7377, d, a, p, J, c, R, 6641, a, 2235, 3033, 3189, 7299, h, T, 5111, k

Example Input: ['Y', 'Z', 'm', 'S', '3631', 'v', 'x', 5851, 615, 'm'], ['D', 'D', 'm', 'S', '3631', 'v', 'O', 'D']
Example Output: m, S, 3631, v

Example Input: ['p', 'x', 'v', 4853, 'y', 'B', 7485, '7551', '9013', 'Q', 'j', '9797', 'T', '7281', '4377', '8701', '55', 'K', 'F', 'E', 'o', '7757', '3393', '5537', 'C', 'T', 'v', 'h', 'x', 'p', 5483, 'p', 'l', 8993, 6193, 'r', 'b', 1589, 4015, 'T', 'Y', 1629, 'H', 'u', 8521, 6161, 'T', 'i'], [1879, 'n', 121, 6899, 8799, 9137, 10011, 'e', '7551', '9013', 'Q', 'j', '9797', 'T', '7281', '4377', '8701', '55', 'K', 'F', 'E', 'o', '7757', '3393', '5537', 'C', 'T', 'v', 'h', 'Q', 'Z', 'U', 4365, 'Q']
Example Output:
7551, 9013, Q, j, 9797, T, 7281, 4377, 8701, 55, K, F, E, o, 7757, 3393, 5537, C, T, v, h