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

Example Input: [4005, 'l', 'F', 4041, 'D', 5853, 'w', 'U', 'w', 'B', 'R', 'S', 4969, 'i', 3323, 889, 'N', 'I', 'T', '3715', 'l', '7103', '5669', 'd', '6091', '6783', 'g', '2319', '5827', 'l', '9691', '2421', 'W', '8085', 'p', 4245, 'H', 'v', 5431, 'q', 'w', 'g', 'u', 'l', 9089, 's', 6469, 'P', 'r'], [625, 'R', 2937, 6877, 'I', 'T', '3715', 'l', '7103', '5669', 'd', '6091', '6783', 'g', '2319', '5827', 'l', '9691', '2421', 'W', '8085', 'O', 's', 'k', 'b', 719, 'F', 779, 295, 3669, 'h', 't', 305, 677]
Example Output: I, T, 3715, l, 7103, 5669, d, 6091, 6783, g, 2319, 5827, l, 9691, 2421, W, 8085

Example Input: ['s', 'J', 2223, 'y', 'v', '9315', '8837', 'z', '8583', 'o', 'c', 'V'], ['E', 5699, 1225, 'f', '9315', '8837', 'z', '8583', 'o', 'u', 'j']
Example Output: 9315, 8837, z, 8583, o

Example Input: ['y', 'n', 'j', 'k', 'V', 'e'], [5759, 5843, 'j', 'k', 'r', 'F']
Example Output:
j, k