Two strings are given. Find their longest common subsequence.
Two strings consisting of small Latin letters. The length of each string is no more than 1000.
Print the longest common subsequence of two strings.