Instructions: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['G', 9607, '4989', 'V', '9731', 'u', 'm', 'I', '3735', '1939', '5695', 'B', '8969', '25', 'y', 'k', '397', '8885', 'q', 'd', '6163', '505', 'D', 'b', 'K', 'p', 't', 'o', 9683, 4407, 'U', 'Y', 'L', 'i', 207, 'y', 'n', 4391, 5823, 2587, 7145, 6129, 'f'], [4333, 1699, 'k', 'y', 8309, 8173, 'M', 'G', '4989', 'V', '9731', 'u', 'm', 'I', '3735', '1939', '5695', 'B', '8969', '25', 'y', 'k', '397', '8885', 'q', 'd', '6163', '505', 'D', 'b', 'K', 'p', 'L', 4945, 'l', 969, 'l', 639, 8177, 9763]
Output:
4989, V, 9731, u, m, I, 3735, 1939, 5695, B, 8969, 25, y, k, 397, 8885, q, d, 6163, 505, D, b, K, p