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

Input: Consider Input: ['P', 'h', 9391, 'u', 9757, 'y', 'a', 'j', 'k', 'Y', '2091', 'U', 'p', 7959, 'F'], [1713, 2679, 'y', 'a', 'j', 'k', 'Y', '2091', 'U', 'V', 'r', 't', 'f', 8179]

Output: y, a, j, k, Y, 2091, U


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

Output: m, S, 3631, v


Input: Consider Input: [9991, 'E', 'e', 8473, 'l', '1879', 'r', '6757', 's', 'G', 3499, 'E', 'C'], [9135, 'u', 'i', 'Q', 'l', '1879', 'r', '6757', 's', 'm', 1881, 5715, 8303]


Output: l, 1879, r, 6757, s