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

Input: Consider Input: [9093, 3879, 'g', 'L', 'h', 'T', 'w', 'w', 'H', 'P', 1709, 'm', 'C'], ['G', 'h', 'L', 'h', 'T', 'w', 'w', 'Z', 'R', 3525, 'g', 8463]

Output: L, h, T, w, w


Input: Consider Input: [8521, 7389, 'Z', 959, 4009, 4683, 'y', '4295', '5675', 'a', '5585', 'q', '5785', '9081', 'U', 's', 'i', 'D', 2717, 'P', 3531, 8889], ['Y', 4689, 'H', 'h', 3485, 1659, '4295', '5675', 'a', '5585', 'q', '5785', '9081', 'U', 's', 'm', 'k', 3777, 'l', 4497, 5837, 7061]

Output: 4295, 5675, a, 5585, q, 5785, 9081, U, s


Input: Consider Input: [1823, 'E', 'f', '4727', '643', 'N', 'G', 'W', 'W', 'c', 'l', 'o', 1627], ['X', 'M', 'U', 't', 'x', '4727', '643', 'N', 'G', 'W', 'W', 'D', 'g']


Output: 4727, 643, N, G, W, W