Given two strings A and B, find the longest common subsequence of A and B (the subsequence does not need to be continuous).
For example, two strings are:
ab is a subsequence of two strings, so is abc and abca. ABCA is the longest subsequence of the two strings.
Line 1: String A
Line 2: String B
(Length of A,B <= 1000)
Output the longest subsequence, if there are more than...