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

Input: Consider Input: [2585, 'R', 'a', 9005, 829, 1751, 'I', 'G', '6211', '5597', '9283', '3429', 'T', 'K', '4887', '4679', '5705', 'u', 'p', 'c', '6329', '6259', 't', 'p', 'I', 'E', 'S', '3507', 'Q', 'K', 1021, 635, 'L', 'r', 'D', 6997, 4363, 'm', 2661, 7933, 'v'], [2855, 'Q', 7207, 'F', 9581, 9807, 3127, 6695, 4363, 'V', 'd', 2791, 't', 4507, 1047, 5959, 2697, 6393, 1751, 5521, 'S', 'G', '6211', '5597', '9283', '3429', 'T', 'K', '4887', '4679', '5705', 'u', 'p', 'c', '6329', '6259', 't', 'p', 'I', 'E', 'S', '3507', 'C', 437, 'c', 63, 469, 'R', 'I', 10007, 'B', 'S', 4919, 'V', 7431, 9317, 9909, 421, 'J', 't', 'O', 'r', 3653]

Output: G, 6211, 5597, 9283, 3429, T, K, 4887, 4679, 5705, u, p, c, 6329, 6259, t, p, I, E, S, 3507


Input: Consider Input: [93, 'H', 'd', 'z', 'G', 'u', '9033', '709', '6413', 'C', 'j', 8909, 5687], [9451, 2867, 'G', 'u', '9033', '709', '6413', 'Y', 'y']

Output: G, u, 9033, 709, 6413


Input: Consider Input: ['q', 'b', 'R', 'Q', 3585, 'r', 7455, '1689', '3921', '6149', '9615', 'Y', 'r', 'y', 'K', 'v', 1947, 223, 3135, 'u'], ['j', 871, 8135, '1689', '3921', '6149', '9615', 'Y', 'r', 'y', 'K', 'b', 7757]


Output: 1689, 3921, 6149, 9615, Y, r, y, K