eolymp
bolt
Try our new interface for solving problems
Problems

Common Subsequence

Common Subsequence

Time limit 1 second
Memory limit 16 MiB

A subsequence of a given sequence is the given sequence with some elements (possible none) left out. Given a sequence X = < x_1, x_2, ..., x_m > another sequence Z = < z_1, z_2, ..., z_k > is a subsequence of X if there exists a strictly increasing sequence < i_1, i_2, ..., i_k > of indices of X such that for all j = 1, 2, ..., k, x_ij = zj. For example, Z = < a, b, f, c > is a subsequence of X = < a, b, c, f, b, c > with index sequence < 1, 2, 4, 6 >. Given two sequences X and Y the problem is to find the length of the maximum-length common subsequence of X and Y.

Input data

The program input is from the std input. Each data set in the input contains two strings representing the given sequences. The sequences are separated by any number of white spaces. The input data are correct.

Output data

For each set of data the program prints on the standard output the length of the maximum-length common subsequence from the beginning of a separate line.

Examples

Input example #1
abcfbc         abfcab
programming    contest 
abcd           mnp
Output example #1
4
2
0