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

[1363, 'O', 'u', '3885', 'y', '2105', '1495', '417', 'n', 9057, 2977], ['x', 'X', '3885', 'y', '2105', '1495', '417', 'X', 2883]
3885, y, 2105, 1495, 417

['W', 'A', '5747', 'i', 'M', 'N', 8861], [1997, 'D', 5205, '5747', 'i', 'M', 'D', 3319, 1895]
5747, i, M

['v', 'j', 'w', '7807', '9879', 'r', 's', '6061', 'r', 'e', 'i'], [5493, 6979, 'I', 'N', 6847, 'w', '7807', '9879', 'r', 's', '6061', 'z', 'U', 2721, 6657]

w, 7807, 9879, r, s, 6061