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

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

Example Input: ['p', 'C', 6777, 'P', 'd', 4619, 'l', '4333', '9491', 'V', '5745', 'P', '9255', '9439', '8461', 'D', 'L', 'w', 'R', 'U', 'C', 'G', 'm'], ['U', 5295, 'O', 'F', '4333', '9491', 'V', '5745', 'P', '9255', '9439', '8461', 'D', 'L', 'w', 'R', 'W', 'C', 'I', 'K', 5891]
Example Output: 4333, 9491, V, 5745, P, 9255, 9439, 8461, D, L, w, R

Example Input: [1679, 2617, '9173', '6397', 'W', 'q', 5635], ['P', 4595, 5285, '9173', '6397', 'W', 'X', 8873, 'r']
Example Output:
9173, 6397, W