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.

['V', 's', 'J', 'r', 'N', 'c', 4209, 'V'], [2913, 2455, 'J', 'r', 'N', 'J', 9847, 4563]
Output:
J, r, N