Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: [733, 'O', 'f', 'Q', 'u', 'p', 9995, 5801, 'u', 'T', 'h', 'U', '4497', 'U', 'h', 'g', '5169', '5941', 'X', '9657', '5023', '2939', '2277', '7781', 'u', '3153', 'Y', 'Y', 'f', 'd', 'a'], ['t', 'k', 513, 5293, 7283, 'Y', 639, '4497', 'U', 'h', 'g', '5169', '5941', 'X', '9657', '5023', '2939', '2277', '7781', 'u', '3153', 'Y', 'e', 3597, 3465, 3163, 'p', 195, 'L', 965, 2629, 4885, 'z', 'v', 6137, 6835, 8451]
Output:
4497, U, h, g, 5169, 5941, X, 9657, 5023, 2939, 2277, 7781, u, 3153, Y