In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

Let me give you an example: [5797, 8817, '8297', 'b', 'U', 'b'], [5843, 8809, '8297', 'b', 'W', 'C']
The answer to this example can be: 8297, b
Here is why: Here, '8297, b' is the longest common subsequence in both the input lists [5797, 8817, '8297', 'b', 'U', 'b'] and [5843, 8809, '8297', 'b', 'W', 'C'].

OK. solve this:
[8545, 'd', 'a', 'T', 1695, 'h', 2137, 't', '713', 'A', 'U', '5889', '8795', '9365', '867', '8159', '7223', 'S', 'K', 'V', '2701', '6227', 'W', 'D', 6309, 3757, 2569, 6359, 6963, 'C', 'Z', 7903], ['i', 9239, 'w', 9027, 973, 8795, 9909, 9007, '713', 'A', 'U', '5889', '8795', '9365', '867', '8159', '7223', 'S', 'K', 'V', '2701', '6227', 'M', 2505, 'h', 5063, 3671, 't', 4595, 'S', 'k', 'V', 6913, 'f']
Answer:
713, A, U, 5889, 8795, 9365, 867, 8159, 7223, S, K, V, 2701, 6227