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.

['Y', 'h', 1649, 'p', 1055, 'a', 'K', '6541', '267', '3155', '547', '9089', '8461', 'e', '7765', 'X', 'P', 'U', 'b', '4411', 'k', 'Q', 1467, 6235, 4089, 8661, 'm', 2207, 't', 9161, 6113, 'm'], [7843, 'v', 'G', 5537, 'p', 9493, 'K', '6541', '267', '3155', '547', '9089', '8461', 'e', '7765', 'X', 'P', 'U', 'b', '4411', 'X', 3169]
Output:
K, 6541, 267, 3155, 547, 9089, 8461, e, 7765, X, P, U, b, 4411