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

Example Input: [7485, 'Y', 'T', '5979', 'w', 'Q', 'e'], [1525, 4389, 'm', 'T', '5979', 'w', 'w', 1497, 8995]
Example Output: T, 5979, w

Example Input: ['w', 3897, 'U', 'a', '455', '6499', '8975', '9003', 'O', 'j', 'T', 'P', 'C', 'z', 5141, 1751, 6731, 'r'], ['B', 8071, 703, 'G', 885, 'Z', 2391, 1749, 4177, 'U', 'a', '455', '6499', '8975', '9003', 'O', 'j', 'T', 'D', 8751, 'y', 2941]
Example Output: U, a, 455, 6499, 8975, 9003, O, j, T

Example Input: [6585, 'U', 8187, 2079, 'P', 'E', 'H', 'V', 'i', 't', 't', '7843', 'U', 'B', 'm', 'N', '8057', '577', 'p', 'O', '5909', 'g', 'f', 8511, 567], ['B', 'c', 'C', 2547, 5235, 4719, 't', '7843', 'U', 'B', 'm', 'N', '8057', '577', 'p', 'O', '5909', 'g', 'O', 'h', 5971, 815, 911]
Example Output:
t, 7843, U, B, m, N, 8057, 577, p, O, 5909, g