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

Input: Consider Input: [1699, 5363, 'U', 3351, 'K', 1771, 8981, 'y', 4317, 'P', 'H', 'f', 'j', '7169', '129', 'Z', 'K', 'r', 'o', 'v', '1713', 'g', 'A', 'h', 'e', '421', 'a', 'b'], [1477, 'o', 'h', 4413, 'Y', 'V', 4539, 't', 'S', 3527, 9183, 9541, '7169', '129', 'Z', 'K', 'r', 'o', 'v', '1713', 'g', 'A', 'h', 'e', '421', 'j', 'V', 8579, 3395, 'l', 'X', 'l', 'm', 4239]

Output: 7169, 129, Z, K, r, o, v, 1713, g, A, h, e, 421


Input: Consider Input: ['o', 'k', '8037', '2095', 'E', 'l'], [4673, 'J', '8037', '2095', 't', 'F']

Output: 8037, 2095


Input: Consider Input: [925, 701, 'O', '3207', 'b', 's', 'c', 8931], ['W', 3889, 'O', '3207', 'b', 'Q', 'Y', 'v']


Output: O, 3207, b