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.

['g', 'z', '1889', 'T', 't', 7179], [6809, 'W', '1889', 'T', 'f', 'F']
Output:
1889, T