{"raw_statement":[{"iden":"problem statement","content":"Given are two strings $S$ and $T$.\nLet us change some of the characters in $S$ so that $T$ will be a substring of $S$.\nAt least how many characters do we need to change?\nHere, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`."},{"iden":"constraints","content":"*   The lengths of $S$ and $T$ are each at least $1$ and at most $1000$.\n*   The length of $T$ is at most that of $S$.\n*   $S$ and $T$ consist of lowercase English letters."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$S$\n$T$"},{"iden":"sample input 1","content":"cabacc\nabc"},{"iden":"sample output 1","content":"1\n\nFor example, changing the fourth character `a` in $S$ to `c` will match the second through fourth characters in $S$ to $T$.\nSince $S$ itself does not have $T$ as its substring, this number of changes - one - is the minimum needed."},{"iden":"sample input 2","content":"codeforces\natcoder"},{"iden":"sample output 2","content":"6"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}