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.

['f', 'b', 5605, 8001, 'c', 5251, 4451, 3805, 'c', 4493, 'Q', 9145, 'B', 'b', '8205', '3357', 'n', 'B', 'h', '3677', 'g', '9841', 'n', '4005', '2183', 'T', '1995', '3945', '5683', 'p', 5753, 391, 7465, 'J', 9357, 'q', 'i', 2319, 'c', 7067, 8445, 8461, 2509, 9843, 'q', 'D'], [9107, 'b', 6723, 'd', 6259, 'M', 9949, 'w', 'S', 'U', 5669, 4317, 6995, 'c', 'B', 'b', '8205', '3357', 'n', 'B', 'h', '3677', 'g', '9841', 'n', '4005', '2183', 'T', '1995', '3945', '5683', 'A', 5717, 9793, 'd']
B, b, 8205, 3357, n, B, h, 3677, g, 9841, n, 4005, 2183, T, 1995, 3945, 5683