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

Example Input: [605, 'W', 7189, 'X', '7897', '5823', 'P', '9001', 'J', 'r', 2595], ['z', 'W', '7897', '5823', 'P', '9001', 'J', 'Z', 'w']
Example Output: 7897, 5823, P, 9001, J

Example Input: [7975, 4703, 'c', '8363', '1673', 'U', 'w', 6977], [3235, 'G', 'c', '8363', '1673', 'N', 'p']
Example Output: c, 8363, 1673

Example Input: [8835, 7931, 6729, 6437, '1995', '7773', 'g', 'x', 'f', 'f', 't', 9413], ['V', 5205, '1995', '7773', 'g', 'x', 'A', 3797]
Example Output:
1995, 7773, g, x