You will be given a definition of a task first, then some input of the task.
In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['e', 'a', 'd', 'j', 8863, 1879, 7555, 515, 'J', 'L', '7085', '4411', '5275', 'n', 'Y', '2479', 'e', 'u', 'y', '5683', '6363', '6661', 'B', '5771', '3805', 'R', 'V', 3027], ['r', 10013, 'J', 'L', '7085', '4411', '5275', 'n', 'Y', '2479', 'e', 'u', 'y', '5683', '6363', '6661', 'B', '5771', '3805', 'R', 't', 'V', 'U', 5793, 1117, 1171]
Output:
J, L, 7085, 4411, 5275, n, Y, 2479, e, u, y, 5683, 6363, 6661, B, 5771, 3805, R