Common Subsequence

A subsequence of a given sequence is that sequence with zero or more of its elements left out. Formally, given a sequence $X = \langle x_1, x_2, \ldots, x_m \rangle$, a sequence $Z = \langle z_1, z_2, \ldots, z_k \rangle$ is a subsequence of $X$ if there is a strictly increasing sequence of indices $\langle i_1, i_2, \ldots, i_k \rangle$ such that $x_{i_j} = z_j$ for every $j = 1, 2, \ldots, k$. For example, $Z = \langle a, b, f, c \rangle$ is a subsequence of $X = \langle a, b, c, f, b, c \rangle$ via the index sequence $\langle 1, 2, 4, 6 \rangle$.

Given two sequences $X$ and $Y$, find the length of a longest common subsequence of $X$ and $Y$ (a sequence that is a subsequence of both).

The input contains several data sets and continues until end of file. Each data set consists of two strings, each representing one sequence. The two strings of a data set, and consecutive data sets, are separated by any amount of white space (spaces, tabs, or newlines). Each string has length at most $200$. The input is guaranteed to be well-formed.

For each data set, print on its own line the length of a longest common subsequence of the two sequences.