Definition: In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.
Input: ['N', 'h', 'd', 'X', 'O', 6279, 'H', '375', 'c', '6473', '405', '8967', '105', '1583', '3941', 'u', 'q', '4359', '8193', '3365', '5833', 'z', 'l', 'S', 'N', '161', 'I', 8935, 5545, 'H', 'd', 865, 7497, 7619], [3003, 3497, 9965, 'a', 8985, 815, 'H', 'G', 'i', 'n', 'H', '375', 'c', '6473', '405', '8967', '105', '1583', '3941', 'u', 'q', '4359', '8193', '3365', '5833', 'z', 'l', 'S', 'N', '161', 'V', 'w', 7375]
Output:
H, 375, c, 6473, 405, 8967, 105, 1583, 3941, u, q, 4359, 8193, 3365, 5833, z, l, S, N, 161