Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [1461, 'B', 'K', 'B', 'H', 'C', 'l', 'g', 'F', 'M', 'f', 'M', '5529', '1079', 'N', '5709', '3883', '8047', '1089', '3805', '8709', 'e', '9133', '8759', '451', '2389', '1079', 't', '5919', 'd', '8897', 'L', 965, 'R', 'G', 5939, 'v', 2277, 'C'], ['K', 2859, 'o', 'M', '5529', '1079', 'N', '5709', '3883', '8047', '1089', '3805', '8709', 'e', '9133', '8759', '451', '2389', '1079', 't', '5919', 'd', '8897', 'k', 'P', 1323, 'd', 957]
Output:
M, 5529, 1079, N, 5709, 3883, 8047, 1089, 3805, 8709, e, 9133, 8759, 451, 2389, 1079, t, 5919, d, 8897