Suppose you have two strings *s* and *t*, and their length is equal. You may perform the following operation any number of times: choose two different characters *c*<sub class="lower-index">1</sub> and *c*<sub class="lower-index">2</sub>, and replace every occurence of *c*<sub class="lower-index">1</sub> in both strings with *c*<sub class="lower-index">2</sub>. Let's denote the distance between strings *s* and *t* as the minimum number of operations required to make these strings equal. For example, if *s* is abcd and *t* is ddcb, the distance between them is 2 — we may replace every occurence of a with b, so *s* becomes bbcd, and then we may replace every occurence of b with d, so both strings become ddcd.

You are given two strings *S* and *T*. For every substring of *S* consisting of |*T*| characters you have to determine the distance between this substring and *T*.
The first line contains the string *S*, and the second — the string *T* (1 ≤ |*T*| ≤ |*S*| ≤ 125000). Both strings consist of lowercase Latin letters from a to f.
none
abcdefa
ddcb
2 3 3 3 
print("_RANDOM_GUESS_1691668865.7560694")# 1691668865.7560863