Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['e', 5825, 'o', 5461, 'i', 'd', 'A', 'E', 8455, 'N', 'N', 'f', 'l', 4297, 2225, 'P', 5097, 'n', '4981', '3693', '801', '3581', '5997', '3265', 'V', 'E', 'o', 'n', 'a', '7181', 'y', '6845', 'I', '4775', '6401', '8661', 'F', 'O', 8733, 9453, 9991, 7883, 't', 8097, 595, 8863, 'K', 'G', 235, 'Z', 'd', 1843, 'p', 2037, 4451], ['r', 'v', 'j', 'I', 1765, 't', 'z', 'J', 's', 'a', 'c', 'q', 5513, '4981', '3693', '801', '3581', '5997', '3265', 'V', 'E', 'o', 'n', 'a', '7181', 'y', '6845', 'I', '4775', '6401', '8661', 'F', 'm', 4125, 'N', 'M', 9993, 'H']
Output:
4981, 3693, 801, 3581, 5997, 3265, V, E, o, n, a, 7181, y, 6845, I, 4775, 6401, 8661, F