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

Input: Consider Input: ['G', 9195, 'n', 'x', 'A', '3777', 'd', 'K', 'W', '1911', '93', '5157', 'j', 'd', 'L'], ['y', 'I', 8025, 5165, 4825, 'L', 'A', 10001, 'x', 'A', '3777', 'd', 'K', 'W', '1911', '93', '5157', 'E', 'b']

Output: x, A, 3777, d, K, W, 1911, 93, 5157


Input: Consider Input: ['p', 9773, 'Y', 'o', 'w', 's', '583', 'e', '2773', '9925', '8535', 'M', '9831', 'V', 'q', 'S', 5087, 'M', 7601, 'D'], [7787, 'l', 'o', 'w', 's', '583', 'e', '2773', '9925', '8535', 'M', '9831', 'V', 'q', 'X', 'W', 3163, 'f', 5201]

Output: o, w, s, 583, e, 2773, 9925, 8535, M, 9831, V, q


Input: Consider Input: ['C', 9817, 'Z', 6277, '3429', 'L', '2415', '1881', '8945', 'l', 8869, 285, 8703], ['d', 's', 3787, '3429', 'L', '2415', '1881', '8945', 'k', 4191, 315, 701, 7259]


Output: 3429, L, 2415, 1881, 8945