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

Example Input: [6211, 8013, 7837, 3385, 'z', 7301, 'D', 'Y', 'Q', 'Y', 'W', '473', '9037', 'K', 'V', '7669', 'R', '6605', 'I', 'k', 5831], ['A', 'N', 'I', 4579, 'R', 'P', 4559, 3977, 'Y', 'W', '473', '9037', 'K', 'V', '7669', 'R', '6605', 'D', 7909, 'x']
Example Output: Y, W, 473, 9037, K, V, 7669, R, 6605

Example Input: [8769, 8805, 'W', 'a', 'l', '9061', 'b', 'A', 'D'], [3199, 'o', 'm', 'a', 'l', '9061', 'b', 'v', 'g']
Example Output: a, l, 9061, b

Example Input: ['z', 'j', 'G', 'w', 'h', 5009, 'z', 'r', '1279', 'z', '1337', 'R', 'R', 9761, 'D', 713], ['a', 'T', 'A', 'z', 'r', '1279', 'z', '1337', 'R', 'J', 'z', 'L', 'P']
Example Output:
z, r, 1279, z, 1337, R