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

Input: Consider Input: [3007, 9911, 'b', 2015, 'P', 'D', 'S', 91, 'G', 'Q', 'g', 'r', 'M', 'I', 'S', 3911, 'Q', 'i', 'd', '6005', 'B', 'g', '1179', '5719', 'L', 'E', 'b', 'c', 'a', 'E', 'n', 'R', '8111', 'A', '3377', 'Y', 2705, 't', 9889], ['l', 3713, 10005, 9299, 'i', 'V', 'v', 6969, 1775, 6541, 6827, 'S', 1677, 1181, 'C', 'i', 'd', '6005', 'B', 'g', '1179', '5719', 'L', 'E', 'b', 'c', 'a', 'E', 'n', 'R', '8111', 'A', '3377', 'p', 557]

Output: i, d, 6005, B, g, 1179, 5719, L, E, b, c, a, E, n, R, 8111, A, 3377


Input: Consider Input: ['x', 9943, 'K', 'O', 'g', 6603, 1275, 'x', 6903, 'c', 9999, 8825, 2529, 'r', 9149, 'W', 6857, 'A', 'c', '551', 'U', '7103', '453', '4397', 'z', '3567', '8685', '4895', 'k', '6657', '8493', 'Z', 'J', 'y', 'v', 'r', 'J', 'g', '3679', '1287', 'p', 6153, 'A', 'S', 8797, 3097, 8983, 'e', 1335, 'L', 'k'], ['N', 3687, 'j', 325, 'I', 'A', 'T', 2921, 'm', 'Z', 9267, 'U', 3985, 7851, 5999, 'b', 'c', '551', 'U', '7103', '453', '4397', 'z', '3567', '8685', '4895', 'k', '6657', '8493', 'Z', 'J', 'y', 'v', 'r', 'J', 'g', '3679', '1287', 'G', 'K', 8039, 7189, 8641, 'x', 'P', 'v', 7977]

Output: c, 551, U, 7103, 453, 4397, z, 3567, 8685, 4895, k, 6657, 8493, Z, J, y, v, r, J, g, 3679, 1287


Input: Consider Input: ['f', 4503, '2975', '3109', '1947', 'z', 7349, 1769], [4959, 8977, '2975', '3109', '1947', 'd', 2747, 'Q']


Output: 2975, 3109, 1947