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.

['d', 2287, 'Z', 'l', 'r', 4087], ['L', 9113, 'Z', 'l', 'w', 'D']
Output:
Z, l