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.

[2411, 'B', '5555', 'T', 'H', 4803], ['p', 'm', '5555', 'T', 'i', 5461]
Output:
5555, T