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

Ex Input:
[6423, 'w', 'K', 'm', 'S', 'X', '8857', 'r', '9809', 'a', 'g', '7297', 'H', 'Q', 'W', 'I', 'm', '3277', 'm', 'W', 'L', 'H', 'S', 'X', 'y', 2479, 'p', 'B', 7193, 8327, 'X', 8547, 2261, 'X', 477, 535, 'w', 'f', 2923], [5389, 6751, 'F', 'l', 9579, 'A', 'S', 'X', '8857', 'r', '9809', 'a', 'g', '7297', 'H', 'Q', 'W', 'I', 'm', '3277', 'm', 'W', 'L', 'H', 'O', 't', 8821, 'H', 3919, 7667, 'x', 'v', 4035, 3179, 9235, 5679, 'c', 'P']

Ex Output:
S, X, 8857, r, 9809, a, g, 7297, H, Q, W, I, m, 3277, m, W, L, H


Ex Input:
['C', 1723, 8981, 3173, 3163, 'j', 'L', 4781, 'N', '5925', '2501', '9697', 'v', 'C', 'O', 'A', '9205', '8339', '3385', 'w', 3467, 'j', 6655, 'P', 8443, 9655], ['v', 'W', 5661, 'z', 'm', 8477, '5925', '2501', '9697', 'v', 'C', 'O', 'A', '9205', '8339', '3385', 'S', 6891, 'H', 'B', 8541]

Ex Output:
5925, 2501, 9697, v, C, O, A, 9205, 8339, 3385


Ex Input:
['M', 237, 'm', 'R', 'e', 'l', 'w', '4027', '3251', '6357', '7687', '4437', '8739', '1693', '1361', '7573', 'R', 'h', 'm', '9757', 'J', 'E', 'd', 8985, 4585, 1255, 'l', 'B', 'a', 1265, 'K'], [917, 'N', 2949, 'H', 9755, 3227, 3653, 'L', 5979, 'l', 'w', '4027', '3251', '6357', '7687', '4437', '8739', '1693', '1361', '7573', 'R', 'h', 'm', '9757', 'J', 'E', 'i', 6781]

Ex Output:

l, w, 4027, 3251, 6357, 7687, 4437, 8739, 1693, 1361, 7573, R, h, m, 9757, J, E