Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [5937, 'p', '5769', 'o', 'z', 'U', 'T', 'v', 'h', 't', 'Q', 'v', 'n', 'Y', '9751', '9369', 'O', 'J', '1843', '1259', 'w', 'v', '1249', '3565', '8607', '83', 'T', '8923', 'd', 'y', 8753, 4123, 'f', 8115, 1997, 'Z', 't', 'J', 'A', 7441, 'd', 'G', 3057, 'h'], [6361, 'T', 2665, 'E', 4855, 7639, 7195, 5607, 1145, 'u', 1743, 'G', '5769', 'o', 'z', 'U', 'T', 'v', 'h', 't', 'Q', 'v', 'n', 'Y', '9751', '9369', 'O', 'J', '1843', '1259', 'w', 'v', '1249', '3565', '8607', '83', 'T', '8923', 'T', 'I', 't', 'Q', 7375, 'C']
Output:
5769, o, z, U, T, v, h, t, Q, v, n, Y, 9751, 9369, O, J, 1843, 1259, w, v, 1249, 3565, 8607, 83, T, 8923