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

Example Input: [9369, 5975, 'W', 'd', 'I', 6029, 3693, 'I', '8101', 'K', '5209', 'l', 'v', 'W', '4841', '6399', 'T', 'F', 'k', '2165', 'w', 'k', 'B', 'o', 'T', 4201, 7599, 'c', 'W'], ['p', 'p', 'L', 'J', '8101', 'K', '5209', 'l', 'v', 'W', '4841', '6399', 'T', 'F', 'k', '2165', 'Y', 'P', 8947, 'q']
Example Output: 8101, K, 5209, l, v, W, 4841, 6399, T, F, k, 2165

Example Input: ['o', 'f', '955', 'y', 'O', 2181], ['M', 'l', '955', 'y', 'h', 5209]
Example Output: 955, y

Example Input: [7393, 361, 7033, 'Q', 5143, 4937, 5079, '4513', 'S', '2005', '9805', 'H', 't', '2457', '8697', 'm', 'N', 9443, 9637, 5881, 2579, 'Q'], ['x', 3109, 6275, 'f', 9511, '4513', 'S', '2005', '9805', 'H', 't', '2457', '8697', 'm', 'w', 8347, 817, 'e', 1859, 1797, 'I']
Example Output:
4513, S, 2005, 9805, H, t, 2457, 8697, m