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

Input: Consider Input: [5533, 1777, 525, 1125, 'f', 's', 'c', 'u', 'c', 'T', 'j', '4947', 'S', 'z', 'j', '2697', 'L', '7579', 'p', '7965', '165', 'F', 'b', 5943], [83, 'k', 581, 'e', 'e', 'p', 397, 'I', 'v', 'T', 'j', '4947', 'S', 'z', 'j', '2697', 'L', '7579', 'p', '7965', '165', 'F', 'T', 503, 4925, 'K', 8507, 'V', 'r', 1103, 8441, 7065, 17, 3791, 8703]

Output: T, j, 4947, S, z, j, 2697, L, 7579, p, 7965, 165, F


Input: Consider Input: ['R', 't', 'y', '2887', 'x', 4883], [5691, 9457, 'y', '2887', 'u', 'Y']

Output: y, 2887


Input: Consider Input: [7091, 141, 7901, 2493, 5977, 'I', '707', 'N', 'M', '9265', '7003', '65', 'C', 9517, 6551, 575, 2727], ['g', 825, 'W', 'U', 'I', '707', 'N', 'M', '9265', '7003', '65', 'f', 9489]


Output: I, 707, N, M, 9265, 7003, 65