Given the task definition and input, reply with output. In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['G', 'c', 8269, 'K', 8867, 'l', 'F', 2059, 3207, 'l', 'W', 'k', 'O', '3809', 'F', '979', 'l', '3649', '9701', 'J', 'N', 'y', '5241', 'o', '2867', '5559', '3871', '531', '9683', '3701', '3317', '2053', 'q', 'o', 'o', 'f', 'I', 'P', 8581], [4861, 1013, 7605, 3225, 'l', 'B', 'M', 3189, 2471, 'X', 'H', 571, 'Y', 8469, 'i', 'P', 4653, 5637, '3809', 'F', '979', 'l', '3649', '9701', 'J', 'N', 'y', '5241', 'o', '2867', '5559', '3871', '531', '9683', '3701', '3317', '2053', 'P', 2601]
3809, F, 979, l, 3649, 9701, J, N, y, 5241, o, 2867, 5559, 3871, 531, 9683, 3701, 3317, 2053