Given the task definition and input, reply with output. In this task, you are given two lists A,B. Find the longest common subsequence in the lists A and B.

['z', 'R', 'v', 'P', '1651', 'k', 't'], [3065, 9653, 10011, 'v', 'P', '1651', 'U', 'V', 5413]

v, P, 1651