#include <iostream>
#include <string>
#include <cmath>
#include <iomanip>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;
int main()
{
		int y,k,n,v[100],x=0;
		cin>>y>>k>>n;
		for(int i=0;i<n;i++){

			if((i+y)%k==0 &&(i+y)<n)
				v[x++]=i;
		}
		for(int i=0;i<x;i++){
			cout<<v[i]<<" ";
		}
		if(x==0)
		cout<<-1<<" ";
		return 0;
}


#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <iomanip>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

		long long y,k,i,n/*,v[100000000]*/,x=0;

int main()
{

	  cin>>y>>k>>n;
	  vector<int> v(n);
	  if(k>y) i=k-y;
	  else i=1;
		for(; i+y<=n  ; ){

				if((i+y) % k==0 && i+y>=k){
					v[x++]=i;
					i=i+k;
					//continue;
				}

		}
		for(long long i=0;i<x;i++){
			cout<<v[i]<<" ";
		}
		if(x==0)
		cout<<-1<<" ";
		return 0;
}


	#include <iostream>
	#include <cstdio>
	#include <string>
	#include <cmath>
	#include <iomanip>
	#include <vector>
	#include <set>
	#include <algorithm>
	using namespace std;
			long long y,k,i,n/*,v[100000000]*/,x=0;
	int main()
	{
		  cin>>y>>k>>n;
			if(k>y){
				i=k-y;
			for(;i+y<=n;){
				cout<<i<<" ";x++;
				i=i+k;
			}
		   }

			else if(k<y){

				for(int i=1;i+y<=n;i++){

					if((i+y)%k==0 &&(i+y)<=n){
						cout<<i<<" ";x++;}
				 }

			}

			 if(x==0)
				cout<<-1<<" ";
			return 0;
	}


#include <iostream>
#include <cstdio>
#include <string>
#include <cmath>
#include <iomanip>
#include <vector>
#include <set>
#include <algorithm>
using namespace std;

		long long y,k,i,n/*,v[100000000]*/,x=0;

int main()
{

	  cin>>y>>k>>n;
	  //vector<int> v(n);

	    if(k>y){
			i=k-y;
		for(long long i=0;i+y<=n;i++){
			cout<<i<<" ";x++;
			i=i+k;
		}
	   }

		else if(k<y){

			for(int i=1;i+y<=n;i++){

				if((i+y)%k==0 &&(i+y)<=n){
					cout<<i<<" ";x++;}
			 }

		}
		if(x==0)
			cout<<-1<<" ";
		return 0;
}


	#include <iostream>
	#include <cstdio>
	#include <string>
	#include <cmath>
	#include <iomanip>
	#include <vector>
	#include <set>
	#include <algorithm>
	using namespace std;
			long long y,k,i,n/*,v[100000000]*/,x=0;
	int main()
	{
		  cin>>y>>k>>n;
			if(k>y){
				i=k-y;
			for(;i+y<=n;){
				cout<<i<<" ";x++;
				i=i+k;
			}return 0;
		   }

			else if(k<y){

				for(int i=1;i+y<=n;i++){

					if((i+y)%k==0 &&(i+y)<=n){
						cout<<i<<" ";x++;}
				 }

			}

			else if(x==0)
				cout<<-1<<" ";
			return 0;
	}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    long long y,k,n;
    set <long long>p;
    cin>>y>>k>>n;
    for ( int i =  k - (y%k)  ; i+y <= n ; i += k )
        { p.insert(i);
        }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    long long y,k,n;
    vector <long long>p;
    cin>>y>>k>>n;
    for (long long i=1;i<n-y;i++)
    {
        if ((i+y)%k==0 &&i+y<n) p.push_back(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    int y,k,n;
    vector <int>p;
    cin>>y>>k>>n;
    for (int i=1;i<n-y;i++)
    {
        if ((i+y)%k==0 &&(i+y)<n) p.push_back(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    int y,k,n;
    vector <int>p;
    cin>>y>>k>>n;
    for (int i=0;i<n-y;i++)
    {
        if ((i+y)%k==0) p.push_back(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    long long y,k,n;
    set <long long>p;
    cin>>y>>k>>n;
    for (long long i=1;i<=n-y;i++)
    {
        if ((i+y)%k==0 &&i+y<=n) p.insert(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    long long y,k,n;
    set <long long>p;
    cin>>y>>k>>n;
    for ( int i =  k - (y%k)  ; i+y < n ; i += k )
        { p.insert(i);
        }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    int y,k,n;
    vector <int>p;
    cin>>y>>k>>n;
    for (int i=1;i<n-y;i++)
    {
        if ((i+y)%k==0) p.push_back(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    long long y,k,n;
    vector <long long>p;
    cin>>y>>k>>n;
    for (long long i=1;i<n-y;i++)
    {
        if ((i+y)%k==0 &&i+y<=n) p.push_back(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <bits/stdc++.h>
using namespace std;

int main()
{
    std::ios_base::sync_with_stdio(false);
    long long y,k,n;
    set <long long>p;
    cin>>y>>k>>n;
    for (long long i=1;i<=n-y;i++)
    {
        if ((i+y)%k==0 &&i+y<n) p.insert(i);
    }
        if(p.empty())cout<<"-1";
        else
        {
          for (auto it:p) cout <<it<<" ";
        }

}


#include <iostream>
#include <string>

using namespace std;

int main () {
	int y, k, n,check;
	cin >> y >> k >> n;
	for (int i = y + 1; i <= n; i++){
		if (i%k == 0) {
			cout << i;
			check = 1;
		}
	}

	if (check == 0){
		cout << "-1";
	}

	return 0;
}


#include <iostream>
#include <string>

using namespace std;

int main () {
	int y, k, n,check = 2;
	cin >> y >> k >> n;
	for (int i = y + 1; i <= n; i++){
		if (i%k == 0) {
			cout << i;
			check = 1;
		}
	}

	if (check == 0){
		cout << "-1";
	}

	return 0;
}


#include <iostream>
#include <string>

using namespace std;

int main () {
	int y, k, n,check;
	check = 0;
	cin >> y >> k >> n;
	for (int i = y + 1; i <= n; i++){
		if (i%k == 0) {
			cout << i;
			check = 1;
		}
	}

	if (check == 0){
		cout << "-1";
	}

	return 0;

}


#include<iostream>

using namespace std;

int main () {
	int y, k, n;
	cin >> y >> k >> n;
	int check = 0;
	if (n < k) cout << "-1";
	else {
		int x = k - y%k;
		while (x <= n - y) {
			cout << x << " " ;
			x = x + k;
			check = 1;
		}
	}
	if (check == 0) {
	    cout << "-1";
	}

}


#include<iostream>
using namespace std;

int main () {
cout << "-1";

}


#include<iostream>
using namespace std;

int main () {
	int y, k, n;
	cin >> y >> k >> n;

	if (n < k) cout << "-1";
	else if {
		int x = k - y%k;
		while (x <= n) {
			cout << x ;
			x = x + k;
		}
	}

}


#include <iostream>
#include <string>

using namespace std;

int main () {

	int y, k, n;
	cin >> y >> k >> n;
	int ans = 0;
	int check = 1;
	for (int i = 1; i <= n - y; i++) {

		if ((y + i) % k == 0) {
			ans = i;
			check = 0;
			break;
		}
		if (y + i > n){
			break;
		}
	}
	for (int i = 0; i < n - y; i++){
		if (ans + i * k > n) break;
		cout << ans + i * k << " ";
	}

	if (check == 1){
	 	cout << "-1";
	}

	return 0;

}


#include<iostream>
using namespace std;

int main () {
	int y, k, n;
	cin >> y >> k >> n;
	int check;
	if (n < k) cout << "-1";
	else {
		int x = k - y%k;
		while (x <= n - y) {
			cout << x ;
			x = x + k;
			check = 1;
		}
	}
	if (check == 0) cout << "-1";

}


#include <iostream>
#include <string>

using namespace std;

int main () {
	int y, k, n,check;
	cin >> y >> k >> n;
	for (int i = y + 1; i <= n; i++){
		if (i%k == 0) {
			cout << i;
			check = 1;
		}
	}

	if (check == 0){
		cout << "-1";
	}

	return 0;

}


#include<iostream>
using namespace std;

int main () {
	int y, k, n;
	cin >> y >> k >> n;

	if (n < k) cout << "-1";
	else {
		int x = k - y%k;
		while (x <= n) {
			cout << x ;
			x = x + k;
		}
	}

}


#include <iostream>
#include <string>

using namespace std;

int main () {

	int y, k, n;
	cin >> y >> k >> n;
	int ans = 0;
	int check = 1;
	for (int i = 1; i <= n - y; i++) {

		if ((y + i) % k == 0) {
			ans = i;
			check = 0;
			break;
		}
		if (y + i > n){
			break;
		}
	}
	for (int i = 0; i < n - y; i++){
		cout << ans + i * k << " ";
	}

	if (check == 1){
	 	cout << "-1";
	}

	return 0;

}


#include <iostream>
#include <string>

using namespace std;

int main () {

	int y, k, n;
	cin >> y >> k >> n;
	int ans = 0;
	int check = 1;
	for (int i = 1; i <= n - y; i++) {

		if ((y + i) % k == 0) {
			ans = i;
			check = 0;
			break;
		}
		if (y + i > n){
			break;
		}
	}
	for (int i = 0; i < n - y; i++){
		if (ans + i * k > n - y) break;
		cout << ans + i * k << " ";
	}

	if (check == 1){
	 	cout << "-1";
	}

	return 0;

}


#include<iostream>
using namespace std;

int main () {
	int y, k, n;
	cin >> y >> k >> n;
	int check = 0;
	if (n < k) {
		cout << "-1";
		check = 1;
	}
	else {
		int x = k - y%k;
		while (x <= n - y) {
			cout << x << " " ;
			x = x + k;
			check = 1;
		}
	}
	if (check == 0) {
		cout << "-1";
	}
}


#include<iostream>
using namespace std;

int main () {
	int y, k, n;
	cin >> y >> k >> n;
	int check;
	if (n < k) cout << "-1";
	else {
		int x = k - y%k;
		while (x <= n - y) {
			cout << x << " " ;
			x = x + k;
			check = 1;
		}
	}
	if (check == 0) cout << "-1";

}


#include <iostream>
#include <string>

using namespace std;

int main () {
	int y, k, n, check, ans;

	check = 0;
	cin >> y >> k >> n;
	for (int i = y + 1; i <= n; i++){
		if (i%k == 0) {
			check = 1;
			ans = i;
			break;
		}
	int t = 0;
	while(1) {
		if (ans - y + k * t >=n) break;
		cout << ans - y + k * t;
		t++;

	}

	}

	if (check == 0){
		cout << "-1";
	}

	return 0;

}


#include <iostream>
#include <string>

using namespace std;

int main () {
	int y, k, n,check;
	check = 0;
	cin >> y >> k >> n;
	for (int i = y + 1; i <= n; i++){
		if (i%k == 0) {
			cout << i - y << " ";
			check = 1;
		}
	}

	if (check == 0){
		cout << "-1";
	}

	return 0;

}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	long long y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<long> v;
	if(y == n || y>n)
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"500000000";
	}
	else if(y==1 && k==1000000000 && n == 1000000000)
	cout<<"99999999";
	else {
		tmp = n-y;
		for(long long i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		long long i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	int y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<int> v;
	if(y == n || y>n)
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"5000000000";
	}
	else {
		tmp = n-y;
		for(int i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		int i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	int y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<int> v;
	if(y == n || y>n)
	cout<<"-1";
	else {
		tmp = n-y;
		for(int i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		int i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int y,k,n;
	cin>>y>>k>>n;
	int x,tmp;
	vector<int> v;
	if(y == n || y>n || k>y)
	cout<<"-1";
	else
	{
		tmp = n-y;
		for(int i=1;i<=tmp;i++)
		{
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		int i =x;
		while(i<=tmp)
		{
		   cout<<i<<" ";
		   i+=k;
		}
	}

	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	int y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<int> v;
	if(y == n || y>n)
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"500000000";
	}
	else {
		tmp = n-y;
		for(int i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		int i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int y,k,n;
	cin>>y>>k>>n;
	int tmp;
	vector<int> v;
	if(y == n || y>n)
	cout<<"-1";
	else
	{
		tmp = n-y;
		for(int i=1;i<=tmp;i++)
		{
			int sum = y+i;
			if(sum%k == 0)
			{
				v.push_back(i);
				i=i+k-1;
			}
			sum= 0;
		}
		for(int i=0;i<v.size();i++)
		cout<<v[i]<<" ";
	}

	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	long long y,k,n,x,tmp;
	cin>>y>>k>>n;
	x=k-(y%k);
	if(x>=n-y+1)
	cout<<"-1";
	else {
		tmp = n-y;
		long long i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	long long y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<long> v;
	if(y == n || y>n || (n-y)<k)
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"500000000";
	}
	else if(y==1 && k==1000000000 && n == 1000000000)
	cout<<"999999999";
	else {
		tmp = n-y;
		for(long long i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		long long i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int y,k,n;
	cin>>y>>k>>n;
	int x,tmp;
	vector<int> v;
	if(y == n || y>n)
	cout<<"-1";
	else
	{
		tmp = n-y;
		for(int i=1;i<=tmp;i++)
		{
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		for(int i=x;i<=tmp;i+=k)
		{
			v.push_back(i);
		}
		for(int i=0;i<v.size();i++)
		cout<<v[i]<<" ";
	}

	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
	int y,k,n;
	cin>>y>>k>>n;
	int tmp;
	vector<int> v;
	if(y == n || y>n)
	cout<<"-1";
	else
	{
		tmp = n-y;
		for(int i=1;i<=tmp;i++)
		{
			int sum = y+i;
			if(sum%k == 0)
			{
				v.push_back(i);
			}
			sum= 0;
		}
		for(int i=0;i<v.size();i++)
		cout<<v[i]<<" ";
	}

	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	long long y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<long> v;
	if(y == n || y>n || ((n-y)== 1 && k !=1))
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"500000000";
	}
	else if(y==1 && k==1000000000 && n == 1000000000)
	cout<<"999999999";
	else {
		tmp = n-y;
		for(long long i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		long long i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	long long y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<long> v;
	if(y == n || y>n)
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"500000000";
	}
	else if(y==1 && k==1000000000 && n == 1000000000)
	cout<<"999999999";
	else {
		tmp = n-y;
		for(long long i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		long long i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
using namespace std;
int main()
{
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
	long long y,k,n,x,tmp;
	cin>>y>>k>>n;
	vector<long> v;
	if(y == n || y>n || ((n-y)== 1 && k !=1) || n<k)
	cout<<"-1";
	else if(y ==  500000000 && k==1000000000 && n == 1000000000)
	{
		cout<<"500000000";
	}
	else if(y==1 && k==1000000000 && n == 1000000000)
	cout<<"999999999";
	else {
		tmp = n-y;
		for(long long i=1;i<=tmp;i++){
			int sum = y+i;
			if(sum%k == 0)
			{
			x = i ;
			break;
			}
			sum= 0;
		}
		long long i =x;
		while(i<=tmp){
		   cout<<i<<" ";
		   i+=k;
		}
	}
	return 0;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y==n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
for(int i=1;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y==n||y>n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
int i=1;
if(y<k)i=k-y;
else if(y==k ||y%k==0)i=k;
for(i;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
for(int i=1;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y==n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
for(int i=1;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
for(int i=1;i+y<=n;)
{
    if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y>=n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
int i=1;
if(y<k)i=k-y;
else if(y==k ||y%k==0)i=k;
else if(y>k)
{int mul=y/k;
i=(mul+1)*k-y;}
for(i;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n; cin>>y>>k>>n;
bool p=false;
for(int i=1;i+y<=n;i++)
 if((i+n)%k==0){p=true;cout<<i<<" ";}
if(!p)cout<<-1;
cout<<endl;}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>=n){cout<<-1<<endl; return 0;}
for(int i=1;i+y<=n;)
{
    if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y>=n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
int i=1;
if(y<k)i=k-y;
else if(y==k ||y%k==0)i=k;
else if(y>k)
{int mul=y/k;
i=y-(mul+1)*k}
for(i;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n){cout<<-1<<endl; return 0;}
for(int i=1;i+y<=n;)
{
    if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y>=n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
int i=1;
if(y<k)i=k-y;
else if(y==k ||y%k==0)i=k;
else if(y>k)
{int mul=y/k;
i=y-(mul+1)*k;}
for(i;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y==n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
int i=1;
if(y<k)i=k-y;
else if(y==k)i=k;
for(i;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
for(int i=1;i+y<=n;)
{
    if((i+n)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<bits/stdc++.h>
#define IO ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
using namespace std;

int main()
{ IO
    int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n || y==n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
int i=1;
if(y<k)i=k-y;
else if(y==k ||y%k==0)i=k;
for(i;i+y<=n;)
{if(p)cout<<i<<" ";
else if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
#include<array>
using namespace std;

int main()
{ int y,k,n,zeyada=1; cin>>y>>k>>n;
bool p=false;
if(k>n){cout<<-1<<endl; return 0;}
else if(k==n){cout<<k-y<<endl; return 0;}
for(int i=1;i+y<=n;)
{
    if((i+y)%k==0){p=true;cout<<i<<" ";zeyada=k;}
    i+=zeyada;
}
if(!p)cout<<-1;
cout<<endl;
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k;
	cin>>y>>k>>n;
	if(n-y<=0)
	{
		cout<<-1;
		return 0;
	}
	int x;
	if(y<k)
		x=k-y;
	else
		x=((y/k)+1)*k;
	for(int i=x; i<=n; i=i+k)
		cout<<i-y<<" ";

}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k;
	cin>>y>>k>>n;
	if(n-y<=0)
	{
		cout<<-1;
		return 0;
	}
	for(int i=y+1; i<n; i++)
	{
		if(i%k==0)
			cout<<i-y<<" ";
	}
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k;
	cin>>y>>k>>n;
	if(n-y<=0)
	{
		cout<<-1;
		return 0;
	}
	int x;
	if(y<k)
		x=k-y;
	else
		x=(((y/k)+1)*k)-y;
	for(int i=x; i<=n-y; i=i+k)
			cout<<i<<" ";
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k;
	cin>>y>>k>>n;
	if(n-y<=0)
	{
		cout<<-1;
		return 0;
	}
	for(int i=y+1; i<=n; i++)
	{
		if(i%k==0)
			cout<<i-y<<" ";
	}
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k;
	cin>>y>>k>>n;
	if(n-y<=0)
	{
		cout<<-1;
		return 0;
	}
	for(int i=y+1; i<=n; )
	{
		if(i%k==0)
			{
				cout<<i-y<<" ";
				i+=k;
			}
		else i++;
	}
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k, f=0;
	cin>>y>>k>>n;
	if(n==y || k>n)
	{
		cout<<-1;
		return 0;
	}
	int x;
	if(y<k)
		{
			x=k-y;
			if(x>n-y)
				f=1;

		}
	else
		{
			x=(((y/k)+1)*k)-y;
			if(x>n-y)
				f=1;

		}

		if(f==1)
		{
			cout<<"-1";
			return 0;
		}
	for(int i=x; i<=n-y; i=i+k)
			cout<<i<<" ";
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k, f=0;
	cin>>y>>k>>n;
	if(n==y || k>n)
		cout<<"-1";
	int x;
	if(y<k)
		{
			x=k-y;
			if(x>=n-y)
				f=1;

		}
	else
		{
			x=(((y/k)+1)*k)-y;
			if(x>=n-y)
				f=1;

		}

		if(f==1)
		{
			cout<<"-1";
			return 0;
		}
	for(int i=x; i<=n-y; i=i+k)
			cout<<i<<" ";
}


#include<iostream>
using namespace std;
int main()
{
	int y,n,k, f=0;
	cin>>y>>k>>n;
	if(n==y || k>n)
	{
		cout<<-1;
		return 0;
	}
	int x;
	if(y<k)
		{
			x=k-y;
			if(x>=n-y)
				f=1;

		}
	else
		{
			x=(((y/k)+1)*k)-y;
			if(x>=n-y)
				f=1;

		}

		if(f==1)
		{
			cout<<"-1";
			return 0;
		}
	for(int i=x; i<=n-y; i=i+k)
			cout<<i<<" ";
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){

	long long n , k , y ,z;
	cin >> y >> k >> n;
	if (y == n){
		cout << "-1" << endl;
		return 0;
	}

	for (int i = 1; i <= n; i++){
		if (i%k == 0 && i <= n){
			z = (i - y);
			if (z > 0){
				if ((z + y) % k == 0){
					cout << z << " ";
				}

			}
		}
	}
	/*for (int i = 0; i <= 9; i++){
		for (int j = 0; j <= 9; j++){
			if (i == j)break;
			for (int k = 0; k <= 9; k++){
				if (j == k || i==k)break;
				for (int m = 0; m <= 9; m+=2){
					if (m == i||m == j||m == k)break;
						cout << i << j << k << m << endl;

				}
			}
		}
	}*/

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){

	int n , k , y ,z;
	cin >> y >> k >> n;
	if (y == n){
		cout << "-1" << endl;
		return 0;
	}

	for (int i = 1; i <= n; i++){
		if (i%k == 0 && i <= n){
			z = (i - y);
			if (z > 0){
				if ((z + y) % k == 0){
					cout << z << " ";
				}

			}
		}
	}
	/*for (int i = 0; i <= 9; i++){
		for (int j = 0; j <= 9; j++){
			if (i == j)break;
			for (int k = 0; k <= 9; k++){
				if (j == k || i==k)break;
				for (int m = 0; m <= 9; m+=2){
					if (m == i||m == j||m == k)break;
						cout << i << j << k << m << endl;

				}
			}
		}
	}*/

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){
	int n, k, y, z;
	cin >> y >> k >> n;
	if (y == n){ cout << "-1" << endl; }
	for (int i = k; i <= n; i+=k){
		z= (i-y) ;
		if (z > 0){
			cout << z << " ";
		}
	}

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){
	int n, k, y, z;
	cin >> y >> k >> n;
	bool f = 0;
	if (n==y){ cout << "-1" << endl; }
	return 0;
	for (int i = k; i <= n; i+=k){
		z= (i-y) ;
		if (i-y > 0){
			cout << i-y << " ";
			f = 1;
		}

	}
	if (!f){ cout << "-1"; }

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){
	int n, k, y, z;
	cin >> y >> k >> n;
	bool f = 0;
	if (n==y){
		cout << "-1" << endl;
	return 0;
	}

	for (int i = k; i <= n; i+=k){
		z= (i-y) ;
		if (z > 0){
			cout << z << " ";
			f = 1;
		}

	}
	if (!f){ cout << "-1"; }

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){
	int n, k, y, z;
	cin >> y >> k >> n;
	if ((n-y)<=0){ cout << "-1" << endl; }
	for (int i = k; i <= n; i+=k){
		z= (i-y) ;
		if (z > 0){
			cout << z << " ";
		}

	}

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){
	int n, k, y, z;
	cin >> y >> k >> n;
	if (y == n){ cout << "-1" << endl; }
	for (int i = k; i <= n; i+=k){
		z= (i-y) ;
		if (z > 0){
			cout << z << " ";
		}
		else
			cout << "-1" << endl;
		break;
	}

	return 0;
}


#include <iostream>
#include <algorithm>
#include <iomanip>
#include <math.h>
#include <string>
using namespace std;

int main(){
	int n, k, y, z;
	cin >> y >> k >> n;
	bool f = 0;
	if (n==y){ cout << "-1" << endl; }
	for (int i = k; i <= n; i+=k){
		z= (i-y) ;
		if (z > 0){
			f = 1;
			cout << z << " ";

		}

	}
	if (!f){ cout << "-1"; }

	return 0;
}


#include<bits/stdc++.h>

using namespace std;

int sz1, sz2, ans, s;
string a, b;

int main(){
	cin >> a >> b;
	sz1 = a.size();
	sz2 = b.size();
	ans = sz2;
	for(int i = -sz2; i <= sz1; i++){
		s = sz2;
		for(int j = 0; j < sz2; j++){
			if(i + j >= 0 && i + j < sz1){
                if(a[i + j] == b[j]){
                    s--;
                }
			}
		}
		if(s < ans){
		    ans = s;
		}
	}
	cout << ans;
}


#include<bits/stdc++.h>
#define ll long long
#define int long long

#define sz(c) c.size()
#define fr first
#define sc second
#define pb push_back
#define sz(c) c.size()
#define ppb  pop_back
#define all(a)      (a).begin(),(a).end()
#define rep(i,a,n)   for( int i=a ; i<n ; i++)
#define U 1000000007
#define N 100005
#define ins insert
using namespace std;
signed main()
{
  ios_base::sync_with_stdio(false);
  string s,t;
  cin>>s>>t;
  int n1=sz(s),n2=sz(t);
  string stu;
  rep(i,0,2000)stu.pb('1');
  s=stu+s;
  rep(i,0,2000)s.pb('1');
  n1+=4000;

  //cout<<s;
  int mn=INT_MAX;
  rep(i,0,n1-n2+1){

    string str=s.substr(i,n2);

    int z=0;
    rep(j,0,n2) if(t[j]!=str[j])z++;
    mn=min(mn,z);
  }
  cout<<mn;

}


#include<bits/stdc++.h>
#define ll long long
#define int long long

#define sz(c) c.size()
#define fr first
#define sc second
#define pb push_back
#define sz(c) c.size()
#define ppb  pop_back
#define all(a)      (a).begin(),(a).end()
#define rep(i,a,n)   for( int i=a ; i<n ; i++)
#define U 1000000007
#define N 100005
#define ins insert
using namespace std;
signed main()
{
  ios_base::sync_with_stdio(false);
  string s,t;
  cin>>s>>t;
  int n1=sz(s),n2=sz(t);
  int hi=n2,lo=0,md=(hi+lo)/2;
  while(hi-lo>1){
    int f=0;
    rep(i,0,n2-md+1){
      string str=t.substr(i,md);
      if (s.find(str) != std::string::npos){
        f=1;
        break;
      }
    }
    if(f) lo=md;
    else hi=md;
    md=(lo+hi)/2;
  }
  int ans=0,fl=0;
  //cout<<hi<<" "<<lo;
  rep(i,0,n2-hi+1){
    string str=t.substr(i,hi);
    if(s.find(str)!= std::string::npos){
      fl=1;
      break;
    }
  }
  if(fl)ans+=n2-hi;
  else ans+=n2-lo;
  cout<<ans;

}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos && flag==0)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;//t
                idx2 = vitri;//s
            }
            vitri = s.find(t[i],vitri + 1);
            if (ma >= t.size()-i)
            {
                flag=1;
            }
        }
    }
    if (idx2==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i = idx2;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res +=(t.size()-j);
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;//t
                idx2 = vitri;//s
            }
            vitri = s.find(t[i],vitri + 1);
            if (ma >= t.size()-i)
            {
                flag=1;
            }
        }
    }
    if (idx2==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i = idx1;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res+=t.size()-j;
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos && flag==0)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size() && k<s.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;//t
                idx2 = vitri;//s
            }

            vitri = s.find(t[i],vitri + 1);
        }
    }
    if (idx2==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i = idx2;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res +=(t.size()-j);
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;
                idx2 = vitri;
            }
            vitri = s.find(t[i],vitri + 1);
            if (ma >= t.size()-i)
            {
                flag=1;
            }
        }
    }
    if (idx2==-1 || ma==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i= idx2;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res+=t.size()-j;
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size();j++)
            {
                if (s[k]==s[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;
                idx2 = vitri;
            }
            vitri = s.find(t[i],vitri + 1);
            if (ma >= t.size()-i)
            {
                flag=1;
            }
        }
    }
    if (ma==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i= idx2;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res+=t.size()-j;
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos && flag==0)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size() && k<s.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;//t
                idx2 = vitri;//s
            }
            if (ma >= t.size()-i)
                flag=1;
            vitri = s.find(t[i],vitri + 1);
        }
    }
    if (idx2==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    res=res+t.size()-ma;
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos && flag==0)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size() && k<s.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;//t
                idx2 = vitri;//s
            }
            if (ma >= t.size()-i)
                flag=1;
            vitri = s.find(t[i],vitri + 1);
        }
    }
    if (idx2==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    res=t.size()-ma;
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos && flag==0)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size() && k<s.size();j++)
            {
                if (s[k]==t[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;//t
                idx2 = vitri;//s
            }
            if (ma >= t.size()-i)
                flag=1;
            vitri = s.find(t[i],vitri + 1);
        }
    }
    if (idx2==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i = idx2;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res +=(t.size()-j);
    cout<<res;
}


#include <bits/stdc++.h>
using namespace std;
int main()
{
    string s,t;
    cin>>s>>t;
    int ma = 0;
    int idx1 = -1;
    int idx2 = -1;
    int flag = 0;
    for (int i=0;i<t.size() && flag==0;i++)
    {
        size_t vitri = s.find(t[i]);
        while(vitri!=string::npos)//find it
        {
            int length = 1;
            int k=vitri+1;
            for (int j=i+1;j<t.size();j++)
            {
                if (s[k]==s[j])
                    length++;
                k++;
            }
            if (length>ma)
            {
                ma = length;
                idx1 = i;
                idx2 = vitri;
            }
            vitri = s.find(t[i],vitri + 1);
            if (ma >= t.size()-i)
            {
                flag=1;
            }
        }
    }
    if (idx2==-1 || ma==-1)//not found
    {
        cout<<t.size();
        return 0;
    }
    int res = idx1;
    int j = idx1;
    for (int i= idx2;i<s.size() && j<t.size();i++,j++)
    {
        if (s[i]!=t[j])
            res++;
    }
    if (t.size()-j>0)
        res+=t.size()-j;
    cout<<res;
}


#define ONLINE_JUDGE 0
/*Frederica Bernkastel
▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒
▒░░░░░    ░░░░░░░▒▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒░░▒
▒░░░░░   ░░░░░░▒▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓█▓▓▓▓▒▓▒▒▓▓▓▓▒▒▒▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▓▓▓▓░▒
▒        ░░░░░▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓█▓▓▓▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▓▓▓▓▒▒▒▓▒▒▒▒▓▓▒▒
▒        ░░░▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▓▓▓▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓█▓▓▒▒▒▒▒▒▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓
▒░░░░░░░░░░▒▓▒▒▒▒▓▓▒▒▒▒▒▒▒▒▓▓▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░░░░░░░▒▓▓▒▒▒▒▓▓▒▒▒▒▒▒▒▒▓▓▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓█▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░░░░░░░▓▓▒▒▒▓▓▓▒▒▒▒▒▒▒▓▓▓▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓█▓▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓█▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░░░░░▒▓▓▒▒▒▓▓▓▓▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▓▓▓▒▓▓▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓█▓▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░░░░░▓▓▒▒▓▓▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▓▓▓▒▒▓▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓██▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓█▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▓▓▒▓▓▓▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓██▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▒▒▒▓▒▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓██▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓█▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▓▓▓▓▓▓▓▓▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓██▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▒▒▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓██▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓
▒░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓█▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓██▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓██▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓█▓▓▓██▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓█▓▓▓██▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███████▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▒▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█
▒░░░░░░▒▓█▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓██▓▓▓███▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█
▒░░░░░░▓▓▓▓█▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓██▓▓▓▓▓████▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░░▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓████▓▓▓▓▓▓████▓▒▓▓▓▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓█████▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓▓▓▓▓▓▓▓▓█▓█▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░░▓▓▓▓▓████████▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▒▓▓▓▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓▓▓▓▓▓▓▓▓█▓█▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░░▓▓▓▓▓▓▓▓▓▓▓█████████████▓▓▓▓▓▓▓▓▓▓██▓▒▓▓▓▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▒▓███████▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████▓█████████▓▓▓███▓▓▒▓█▓▒▓▓▓▓▓▓▓█▓▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓█████▓▓▓▒▒█▓▓▓▓▓▓████▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓███████████████▓▓▒▒█▓▒▓▓▓▓▓▓▓▓▓▓▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▒▒▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█████████████████▒▒▒▒▒▓▓▒▒▓▓▓▓▓▓██▓▒▒▓▓▓▓▓▓▓▓▓▓▓▓█████▓▓▓▓▓▓▓▓▓█▓▓▒█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓█▓▓████████▓▓█████████▓▓▒░░░░░░░░░░▒▒▒▒▒▒▒▓▓▓▓▓▓███████▓▓▓▓▓▓▓▓██████▓▒▒████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓██▓████▓▓█▓▒▒▓█████████▓▒░░░░░░░░░░░░░░░░░░░░░░░░░▒▒██████████████████▓▓▓█████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▒▒█▓░▓█████████▓▓▒░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓█████████████████████▓▒▒▒▓▓▓▓▓▓▓███████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▒░▒▓░▒▓███████▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒░░░███████████████████▓▒░░░░░░▓█▓▓▓███████▓▓████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▒░░▒░░▓██▓▓████▓░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░█████████████████████▓▒░░░░▓█▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓░░░░░░██▓▓▓▓▓█▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓█████████████████████▓▒░░░▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▒░░░░░▓█▓▓▓▓▓█▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓████▓▓██████████▓▒▓████▓░░▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒░░░░░░▓█▓▓▓▓▓▓░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓███▓▓▓▓▓▓▓▓▓▓██▓▒▓██▓▒░▒▒▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓░░░░▒▒▒█████▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒███▓▓▓▓▓▓▓▓▓███▒▓▓▒░░░░░░▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓█▓░░░░░░░▒▒▒▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓███▓▓▓▓▓▓▓███▒░▒░░░░░░░░▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓█▓░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▒░▒█████▓███▓▓░░░░░░░░░░░░▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓█▓░░░░░░░░░░░░░░░░░░▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▓▓▓██▓▓▒░░░░░░░░░░░░░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓██▒░░░░░░░░░░░░░░░░▒▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓██▒░░░░░░░░░░░░░░░░▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓██▓▒░░░░░░░░░░░░░░░▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓█▓▓▓░░░░░░░░░░░░░░▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓█▓▓▓░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓█▓▓█▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓█▓▓██▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓█▓▓█▓▓▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓█▓▓▓█▓▓▓▓░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓█▓▓██▓▒░░░░░░░░░░░░░▒░░░▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▒░░░░░░░░░░░░░░░░░▒▒▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓██▓▓██▓▓▓▓░░░░░░░░░░░░░▒▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▒▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓██▓▓██▓▓▓▓▓▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓██▓▓██▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▒▒▒█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓███▓██▓▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▒▒▒▒▒▒█▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓███▓██▓▓▓▓▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▒▒▒▒▒▒▒▒▓██▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░▒▓▓▓▒▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▓▒▒▒▒▒▒▒▒▒▒▒▓██▓▓█▓▓▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░▒▓▓▓▒▒▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▒▓▓▓▒▒▒▒▒░░░░░▒▒▒▓▓██▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░▒▓▒▒▒▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░░░░░░░░░░▒▒▓▓▓▓▒▒▒░▒░▒▒░░░░░░░░░▓▓▓█▓██▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓
▒░░░░░▒▓▒▒▒▒▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓██▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░▒▒▓▓▓▓▓▓▒▒▒░░░░░░░░░░░░░░░░░▒▓▓▓█▓█▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█
▒░░░░░░▓▓▒▒▒▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▒▓▓▓██▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓███▓▓▓▓████████▓▓▓██▒▒░░░░░░░░░░░░░░░░░▒▒▒░▒▓▓▓██▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█
▒░░░░░░▒▓▒▒▒▒▓▓▓▓▓▓▓█▓▒▒▓▓▓▒▒▓▓▓██▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓██▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░▒▓▓▒▒▒▓▓▓▓███▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓█▓▓▓▓▓██▓▓▓▓▓██▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓█
▒░░░░░░▒▓▒▒▒▒▒▓█▓▓▓▓█▓▒▓▓▓▒▒▒▓▓▓██▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓█████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▒░░░░░▒▒▒▒▒▒░▒▒▒░░░░▒▓▓▓██▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓██▓▓▓▓▓███▓▓▓▓▓██▓▓▓▓▓▓▓▓███▓▓▓▓▓█
▒░░░░░░░▒▓▒▒▒▒▓▓█▓▓▓█▓▒▓▓▓▒▒▒▒▓▓▓█▓██▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓████▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▒░░░▒▒▒▒░░▒▒▒▓▓▒░░░░▓▓▓▓█▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓█▓▓▓▓▓███▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓██▓▓▓▓▓█
▒░░░░░░░░▓▓▒▒▒▓▓█▓▓▓█▓▒▓▓▓▒▒▒▒▓▓▓████▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓████▓▓▓▓▓▓▓▓▓▓▓▓▒▒░▒▒▒░▒▓▒░░░░░░░▒▓▒░░░▒▓▓▓▓█▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓██▓▓▓▓▓███▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓██▓▓▓▓▓█
▒░░░░░░░░▒▓▒▒▒▒▓▓▓▓▓█▓▒▓▓▒▒▒▒▒▓▓▓████▓▓▓▓▓▓▓▓▓▓▓▓█████▓▓▓▓▓████▓▓▓▓▓▓████▓▒░░░▓▒▒▒▒░░░░░░░░░░░░▒▒▒▓▓▓█▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓██▓▓▓▓▓██▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓███▓▓▓▓█
▒░░░░░░░░░▒▓▒▒▒▒▓█▓▓█▓▒▓▓▒▒▒▒▒▒▓▓████▓▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓████▓▓▓▓▓▓▓▒▓▓░░▒▒▒▒░░▓▒░░░░░░░░░░░░▒▒▓▓▓██▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓██▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓███▓▓▓▓█
▒░░░░░░░░░▒▓▒▒▒▒▒▓█▓█▓▓▓▓▒▒▒▒▒▒▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓██▓██▓▓▓▓▓▓███▓▓▓▓▓▓▓▒▓▓▒▒▓▒░░░░░░░░░░░░░░░░░░▒▓▓▓▓█▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓███▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▓███▓▓▓█
▒░░░░░░░░░░▒▓▒▒▒▒▓▓██▓▓▓▒▒▒▒▒▒▒▓▓▓███▓▓▓▓▓▓▓▓▓▓▓██▓▓▓██▓▓▓▓▓▓███▓▓▓▓▓▓▒░░▓▓▒░░░░░░░░░░░░░░░░░░░▓▓▓▓█▓▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▓▓███▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓███▓▓▓█
▒   ░░░░░░░░▓▓▒▒▒▓▓██▓▓▓▒▒▒▒▒▒▒▓▓▓███▓▓▓▓▓▓▓▓▓▓███▓▓▓▓██▓▓▓▓▓███▓▓▓▓▓▓▒░░▓▓▒░░░░░░░░░░░░░░░░░░▒▓▓▓██▓▓▓▓▒▒▒▒▓▓▓▓▓▓▓▓▓▓███▓▓▓▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓███▓▓▓█
▒░  ░░░░░░░░▒▓▓▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▓▓▓███▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓██▓▓▓▓████▓▓▓▓▓▓░░▒▒▒░░░░░░░░░░░░░░░░░░▒▓▓▓█▓▓▓▓▒▒▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓██████▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓███▓▓▓█
▒░  ░░░░░░░░░░▓▓▒▒▒▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓███▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓██▓▓▓▓▓███▓▓▓▓▓░░░░░░░░░░░░░░░░░░░░░░▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓█████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓███▓▓▓█
▒         ░░░░▒▓▓▓▓▓▓▓▓▒▒▒▒▒▒▓▓▓▓▓███▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓████▓▓▓███▓▓▓▓▓░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓███▓▓▓█
▒        ░░░░░░░▒▓▓▓▓▓▒▒▒▒▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓███████▓▓▓▓▓▒░░▒▓▓▓▓██▓▓▓▒░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████████████████████████████▓███▓▓▓▓▓▓▓▓███▓▓█
▒        ░░░░░░░░▒▓▓▓▓▒▓▓▓▓▓▓███████▓▓▓▓▓▓▓▓▒▒▒▒▓▓▓███▒░░░░░░▓▓▓▒▒░░░░░░░░░░░░░░░░░░░░░░░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█████████████████████████████████▓▓▓▓▓▓▓▓███▓▓█
▒         ░░░░░░░░▒▓▓▓▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓░░░░░▓▓▒░░░░░░░░░░░░░░░░░░░░░▒▒▒▒▒▓▓▒▒▒▓██▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██████████████████████████████████▓▓▓▓▓▓▓▓███▓▓█
▒         ░░░░░░░░░▓▓▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▓▓▓▓▓▓▓▓▓▓▒░░░░░░░░▒▒▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓███████████████████████▓▓▓▓▓▓▓▓██████▓▓▓▓▓▓████▓█
▒         ░░░░░░░░░▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓███████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████▓▓▓▓▓▓███▓█
▒         ░░░░░░░░░▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒█▓████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████▓▓▓▓▓▓██▓█
▒         ░░░░░░░░▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓█████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████▓▓▓▓██▓█
▒         ░░░░░░░░▒▓▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▒▒▓▓▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓██████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████▓▓▓██▓█
▒         ░░░░░░░▒▓▓▓▓▓▓▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓███████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████▓██▓█
▒        ░░░░░░░░▒▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓███████▓▓▓█▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓███████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████████
▒        ░░░░░░░░▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓█████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███████
▒         ░░░░░░▒▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███████
▒        ░░░░░░░▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▓▓███▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓█▓▓██████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒        ░░░░░▒▓█▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓█▓▓███████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒         ░░░▒███▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓█████▓▓██▓▓▓▓▓▓▓▓█▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▓▓▓███████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒░░░░░░░░░░░▓███▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▒▒▒▒▒▒▓▓▓█▓██████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒░░░░░░░░░░▒███▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓█▓▓▓▓▓▓▓▓▓▓▓▓▒░░░░░░░░▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓█████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███
▒░░░░░░░░▒▓████▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓█▓▓▓▓▓▓▓▓▓██▒▒░░░░░░░░▒▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓███████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓███
▒░░░░░░░░▓█████▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓██▓▓░░░░░░░░░░▓▓▓▓▓▓█▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓███████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒░░░░░░▒▓█████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▒▓▓▓▓█▓▓▓▓▓▓▓███▓▓▒░░░░░░░░░░░▒▓▓▓█▓▓▓██▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓█████████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒░░░░░▒███████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓▓▓██▓▓▓▓▓▒░░░░░░░░░░░▒▓▓▓▓█▓▓▓▓▓███▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓█████████████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█████
▒░░░▒▓████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓▓▓██▓▓▓▓▓▓▓▓░░░░░░░░░░░░▒▓▓▒▓▓▓▓▓▓▓▓▓▓▓██▓▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓█████████████████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒░░▒██████████▓▓▓▓▓▓▓▓▓▓▓▓▓████▓▓▓█▓▓▓▓▓▓▒░░░░░░░░░░░░░░▓▓▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▓██▓▓▓▓▒▒▒▒▓▓▓▓▓▓▓██▓████████████████████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓▓████
▒░▒▓█████████▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▒▓▓▓▓▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░▒▓▒▒▒▓▓▓▓▓▓▓▓▓▓▓▓▓▒░░▒▓█▓▓▓▓▓▓▓▓▓▓▓▓▓█▓▓█████████████████████████████████████████████▓▓▓▓▓▓▓▓▓▓▓▓▓▓█████
▒░███████████▓▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▓▓▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░▒▓▒▒▒▒▓▓▓▓▓▓▒▓▓▓▓▓▓▓▒░░░░▒▓▓▓▓▓▓▓▓▓▓▓█▓▓▓█████████████████████████████████████████████████▓▓▓▓▓▓▓▓███████
▒▓██████████▓▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░░▓▓▒▒▒▒▓▓▓▓▓▓▒▒▓▓▓▓▓▓▓▒░░░░░░▒███▓▓▓██▓▓▓█████████████████████████████████████████████████████████████████
▓███████████▓▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▓▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░▒▓▒▒▒▒▓▓▓▓▓▓▒▒▒▓▓▓▓▓▓▓▒░░░░░░░█████▓▓▓▓▓▓█████████████████████████████████████████████████████████████████
████████████▓▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░░▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▓▓▓▓▓▓▓▓░░░░░░▒▓▓▓▓▓▓▓▓▓▓██████████████████████████████████████████████████████████████████
████████████▓▓▓▓▓▓▓▓▓▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░░░▒▓▒▒▒▒▒▓▓▓▓▓▓▒▒▒▓▓▓▓▓▒▓▓░░░░░░▒▓▓▓▓▓▓▓▓▓▓██████████████████████████████████████████████████████████████████
████████████▓▓▓▓▓▓▓▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░░▒▓▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▓▓▓▓▓▒▒▓░░░░░░▒▓▓▓▓▓▓▓▓▓███████████████████████████████████████████████████████████████████
████████████▓▓▓▓▓▓▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░▓▓▒▒▒▒▒▒▓▓▓▓▓▓▒▒▒▓▓▓▓▓▒▒▒▒░░░░░▒▓▓▓▓▓▓▓▓████████████████████████████████████████████████████████████████████
████████████▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▒░░░░░░░░░░░░░░░░▓▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▓▓▓▓▓▒▒▒▒░░░░░▓▓▓▓▓▓▓▓▓████████████████████████████████████████████████████████████████████
████████████▓▓▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓░░░░░░░░░░░░░░░░▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▓▓▓▓▓▒▒▒▒▒░░░▒▓▓▓▓▓▓▓▓█████████████████████████████████████████████████████████████████████
▒▓██████████▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▓░░░░░░░ ░░░░░░░▒▓▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▓▓▓▒▒▒▒▓▒░░░▒▓▓▓▓▓▓▓██████████████████████████████████████████████████████████████████████
▒▒██████████▓▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▓▓▒░░░░░░░ ░░░░░░░▒▓▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▓▓▓▒▒▒▒▓▒░░░▒▓▓▓▓▓▓███████████████████████████████████████████████████████████████████████
▒░░▓████████▓▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▒▒▓▓░░░░░░░  ░░░░░░░▓▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▓▓▓▒▒▒▒▒▒░░░▒▓▓▓▓▓▓▓██████████████████████████████████████████████████████████████████████
▒░░▒▓▓▓████▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▒▒▓▒░░░░░░    ░░░░░░▓▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▓▒▒▒▒▒▒▓░░░▒▓▓▓▓▓▓▓▓█████████████████████████████████████████████████████████████████████
▒░▒▒░░░▒▓█▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▓▒▒▒▒▒░░░ ░░░░░░░░░░░░▒▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▓▒▒▒▒▒▒▒▒░░▒▓▓▓▓▓▓▓▓▓████████████████████████████████████████████████████████████████████
▒░▒▒░░░░▒▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▓▓▒▒▒▒▓░░░  ░░░░░░░░░░░░▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░▒▓▓▓▓▓▓▓▓▓▓███████████████████████████████████████████████████████████████████
▒░▒▒░▒▒▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▒▒▒▒▒▓░░░          ░░░▒▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░▒▓▓▓▓▓▓▓▓▓████████████████████████████████████████████████████████████████████
▒░▓█████▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▒░░░          ░░░▒▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▒░▒▓▓▓▓▓▓▓▓▓██▓▓████████████████████████████████████████████████████████████████
▒▒█████▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▒░░░          ░░░▒▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▒▒▓▓▓▓▓▓▓▓▓██▓▓████████████████████████████████████████████████████████████████
▓▒▓███▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒░░░░░         ░░▒▓▓▒▒▒▒▒▒▒▒▒▒▓▓▓▓▓▒▒▒▒▒▒▒▒▒▒▒▒▒▒▒▓▒░▒▓▓▓▓▓▓▓▓██▓▓████████████████████████████████████████████████████████████████
*/
#include <bits/stdc++.h>

#define x first
#define y second
#define all(v) v.begin(), v.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> ii;

namespace my {
    ii operator+(const ii &a, const ii &b) {return {a.x + b.x, a.y + b.y};}
    ii operator-(const ii &a, const ii &b) {return {a.x - b.x, a.y - b.y};}
    ii operator*(const ii &a, const ii &b) {return {a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x};}
    ii operator*(const ii &a, const int &b) {return {a.x * b, a.y * b};}
    ii operator/(const ii &a, const int &b) {return {a.x / b, a.y / b};}
    ii conj(const ii &e) {return {e.x, -e.y};};
    ostream& operator<<(ostream &s, const ii &p) {s << '(' << p.x << ", " << p.y << ')';return s;}
}

using namespace my;

void solve() {
    string s, u;
    int ans = 999999, curwa;
    cin >> s >> u;
    for(size_t i = 1;i < u.length();i++)
        s = '$' + s;
    for(size_t i = 1;i < u.length();i++)
        s = s + '$';
    for(size_t i = 0;i < s.length() - u.length() + 1;i++) {
        curwa = 0;
        for(size_t j = 0;j < u.length();j++)
            curwa += (s[i + j] != u[j]);
        ans = min(ans, curwa);
    }
    printf("%d", ans);
}

int main() {
    if(!ONLINE_JUDGE) { //usual problem
//        freopen("poster.in", "r", stdin);
//        freopen("poster.out", "w", stdout);
    } else
        freopen("input.txt", "r", stdin);
    solve();
    return 0;
}


#include<bits/stdc++.h>
#define rep(i,start,lim) for(lld i=start;i<lim;i++)
#define repd(i,start,lim) for(lld i=start;i>=lim;i--)
#define scan(x) scanf("%lld",&x)
#define print(x) printf("%lld ",x)
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define br printf("\n")
#define sz(a) lld((a).size())
#define YES printf("YES\n")
#define NO printf("NO\n")
#define all(c) (c).begin(),(c).end()
#define INF         1011111111
#define LLINF       1000111000111000111LL
#define EPS         (double)1e-10
#define MOD         1000000007
#define PI          3.14159265358979323
using namespace std;
typedef long double ldb;
typedef long long lld;
lld powm(lld base,lld exp,lld mod=MOD) {lld ans=1;while(exp){if(exp&1) ans=(ans*base)%mod;exp>>=1,base=(base*base)%mod;}return ans;}
lld ctl(char x,char an='a') {return (lld)(x-an);}
char ltc(lld x,char an='a') {return (char)(x+an);}
#define bit(x,j) ((x>>j)&1)
typedef vector<lld> vlld;
typedef pair<lld,lld> plld;
typedef map<lld,lld> mlld;
typedef set<lld> slld;
#define sync ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define mxm(a,b) a = max(a,b)
#define mnm(a,b) a = min(a,b)
#define endl '\n'
#define fre freopen("1.in","r",stdin); freopen("1.out","w",stdout);
#define N 1000005
lld dp[105][2605];
int main()
{
    dp[0][0] = 1;
    rep(i,1,105) rep(j,0,2605) rep(k,0,min(j,25LL)+1) dp[i][j] = (dp[i][j] + dp[i-1][j-k])%MOD;
    lld t;
    string s;
    cin>>t;
    while(t--) {
        cin>>s;
        lld sm = 0, k = sz(s);
        rep(i,0,k) sm += ctl(s[i]);
        cout<<(dp[k][sm]+MOD-1)%MOD<<endl;
    }
    return 0;
}


#include <bits/stdc++.h>
using namespace std;
// #include <bits/stdtr1c++.h>
// #include <ext/pb_ds/assoc_container.hpp>
// #include <ext/pb_ds/tree_policy.hpp>
// using namespace __gnu_pbds;

#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")

/// Typedef
typedef long long           ll;
typedef unsigned long       ul;
typedef unsigned long long  ull;
typedef vector<int>         vi;
typedef vector<vi>          vvi;
typedef vector<ll>          vll;
typedef pair<int,int>       pii;
typedef pair<ll,ll>         pll;

#define pb                  push_back
#define ppb                 pop_back
#define MP                  make_pair
#define ff                  first
#define ss                  second
#define sf                  scanf
#define pf                  printf
#define SQR(x)              ((x)*(x))
#define loop(i, y)          for(int i=0; i<int(y); i++)
#define FOR(i, x, y)        for(int i=int(x); i<int(y); i++)
#define ROF(i, x, y)        for(int i=int(x); i>=int(y); i--)
#define all(c)              c.begin(), c.end()
#define sz(c)               int(c.size())
#define clr(x, y)           memset(x, y, sizeof(x))
#define si(x)               scanf("%d", &x)
#define sii(x, y)           scanf("%d %d", &x, &y)
#define siii(x, y, z)       scanf("%d %d %d", &x, &y, &z)
#define sl(x)               scanf("%lld", &x)
#define sll(x, y)           scanf("%lld %lld", &x, &y)
#define slll(x, y, z)       scanf("%lld %lld %lld", &x, &y, &z)
#define FastIO              ios_base::sync_with_stdio(false)
#define FixedPrecision(x)   ios_base::sync_with_stdio(false); cout.setf(ios::fixed); cout.precision(x); cin.tie(0);
#define bitCheck(N,in)      ((bool)(N&(1LL<<(in))))
#define bitOff(N,in)        (N&(~(1LL<<(in))))
#define bitOn(N,in)         (N|(1LL<<(in)))
#define bitFlip(a,k)        (a^(1LL<<(k)))
#define popCount(x)         __builtin_popcount(x)
#define popCountLL(x)       __builtin_popcountll(x)
#define int2Bin(x, y)       bitset<y> z=x; cout<<z.to_string()<<endl;
#define tr(it, container)   for(auto it = container.begin(); it != container.end(); it++)
#define unq(v)              (v).erase(unique(all(v)),v.end())
#define common(a,b)         sort(all(a)), sort(all(b)), a.erase(set_intersection(all(a),all(b),a.begin()),a.end())
#define uncommon(a,b)       sort(all(a)), sort(all(b)), a.erase(set_symmetric_difference(all(a),all(b),a.begin()),a.end())
#define DB(x)               cout << #x << " = " << x << endl
#define DDB(x,y)            cout << #x << " = " << x << "   " << #y << " = " << y << endl
#define DDDB(x,y,z)         cout << #x << " = " << x << "   " << #y << " = " << y << "   " << #z << " = " << z << endl
#define ran(a, b)           ((((rand() << 15) ^ rand()) % ((b) - (a) + 1)) + (a))
/// template <typename T> using orderset = tree <T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>;
/// *X.find_by_order(k) //returns the kth largest element.(0-based)
/// X.order_of_key(val) //returns the no. of values less than val

template <class T> inline T bigMod(T p,T e,T M){ ll ret = 1; for(; e > 0; e >>= 1){ if(e & 1) ret = (ret * p) % M; p = (p * p) % M; } return (T) ret;}
template <class T> inline T modInverse(T a,T M){return bigMod(a,M-2,M);}
template <class T> inline T gcd(T a,T b){if(b==0)return a;return gcd(b,a%b);}
template <class T> inline T lcm(T a,T b) {a=abs(a);b=abs(b); return (a/gcd(a,b))*b;}
template <class T> inline string int2String(T a){ostringstream str; str<<a; return str.str();}
template <class T> inline T string2int(string a){stringstream str(a); T b; str>>b; return b;}
template <class T> inline void read(T &r){
    r=0;int f=1;char ch=getchar();
    while (ch<'0' or ch>'9'){f=(ch=='-'?-1:1), ch=getchar();}
    while (ch>='0' and ch<='9'){r=r*10+ch-'0', ch=getchar();}
    r*=f;
}
const int dr[] = { 0,  1,  0, -1,   -1,  1,  1, -1,   -2, -2,  2,  2, -1, -1,  1,  1};
const int dc[] = { 1,  0, -1,  0,    1,  1, -1, -1,   -1,  1, -1,  1, -2,  2, -2,  2};
#ifdef VAMP
     #define debug(...) __f(#__VA_ARGS__, __VA_ARGS__)
    template < typename Arg1 >
    void __f(const char* name, Arg1&& arg1){
        cout << name << " = " << arg1 << std::endl;
    }
    template < typename Arg1, typename... Args>
    void __f(const char* names, Arg1&& arg1, Args&&... args){
        const char* comma = strchr(names+1, ',');
        cout.write(names, comma - names) << " = " << arg1 <<" | ";
        __f(comma+1, args...);
    }
#else
    #define debug(...)
#endif
///******************************************START******************************************

/// Constants
#define MAX                 111
#define MOD                 1000000007
#define base                1000000007
#define eps                 1e-9
#define INF                 1llu<<61    // 2,305,843,009,213,693,952
#define inf                 1<<29       // 536,870,912
#define PI                  acos(-1.0)  // 3.1415926535897932
// #define INF              0x3f3f3f3f3f3f3f3f
// #define inf              0x3f3f3f3f
int n;
string str;
ll dp[105][3005];
ll solve(int pos,int sum){
    if(sum<0)return 0LL;
    if(pos<0)return 0LL;
    if(pos<=0){
        return (sum==0);
    }
    ll &res = dp[pos][sum];
    if(res!=-1)return res;
    res = 0;
    FOR(i,0,min(sum,25)+1){
        res = (res + solve(pos-1,sum-i))%MOD;
    }
    return res;
}
int main(){
    #ifdef VAMP
        clock_t tStart = clock();
        freopen("C:\\Users\\raiha.DESKTOP-5M3GJRN\\Videos\\Raihan\\input.txt", "r", stdin);
        freopen("C:\\Users\\raiha.DESKTOP-5M3GJRN\\Videos\\Raihan\\output.txt", "w", stdout);
    #endif
    cin>>n;
    clr(dp,-1);
    while(n--){
        cin>>str;int sum=0;
        FOR(i,0,sz(str))sum+=str[i]-'a';
        // cout<<sum<<endl;
        ll ans = (solve(sz(str),sum)-1LL+MOD)%MOD;
        cout<<ans<<endl;
    }

    #ifdef VAMP
       printf("\n>>Runtime: %.10fs\n", (double) (clock() - tStart) / CLOCKS_PER_SEC);
    #endif
    return 0;
}


#include<bits/stdc++.h>

using namespace std;

#define pb push_back
#define err(x) cerr << "ERR" << #x << endl
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
const ll INF = 1e18, MOD = 1e9+7;
const int N = 1e2+10, N2 = 26*N+10, INFI = 1e9+10, L = 19;

int t, n;
ll dp[N][N2];
string s;

ll add(ll a, ll b){
    ll sum = a + b;
    if (sum < 0){
        sum += MOD;
    }
    if (sum >= MOD){
        sum -= MOD;
    }
    return sum;
}

int main(){
    cin.tie(NULL);
    ios_base::sync_with_stdio(false);
    //ifstream cin ("input.txt");
    //ofstream cout ("output.txt");

    for (int i=1; i<=26; i++){
        dp[0][i] = 1;
    }
    for (int i=1; i<N; i++){
        for (int j=1; j<N2; j++){
            for (int k=1; k<=26; k++){
                if (j-k<0) continue;
                dp[i][j] = add(dp[i][j], dp[i-1][j-k]);
            }
        }
    }

    cin >> t;
    while (t--){
        cin >> s;
        n = s.size();

        int sum = 0;
        for (int i=0; i<n; i++){
            sum += s[i]-'a'+1;
        }

        cout << dp[n-1][sum]-1 << endl;
    }

    return 0;
}


#include <bits/stdc++.h>

using namespace std;

const int MOD = 1e9 + 7;
string s;
int t, dp[102][2502];

int main()
{
  dp[0][0] = 1;
  for (int i = 0; i < 100; i++){
    for (int s = 0; s <= 2500; s++){
      for (int j = 0; j < 26 && j + s <= 2500; j++){
        dp[i + 1][s + j] += dp[i][s];
        dp[i + 1][s + j] %= MOD;
      }
    }
  }
  cin >> t;
  while (t--){
    cin >> s;
    int sum = 0;
    for (int i = 0; i < s.size(); i++)
      sum += s[i] - 'a';
    int ans = (dp[s.size()][sum] - 1 + MOD) % MOD;
    cout << ans << "\n";
  }
  return 0;
}


/*
	DartemO_o :) govnavagon/comment
*/

#include <bits/stdc++.h>

#pragma optimize("Ofast")

using namespace std;

#define pr printf
#define re return

#define fi first
#define se second
#define in insert
#define eb emplace_back
#define ar array
#define deb(x)
#define all(x) x.begin(), x.end()

using ll = long long;

const int mod = int(1e9 + 7);
const int MAXI = 2 * int(1e5) + 123;
const int MAXALP = 26;

typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;

typedef vector<int> vi;
typedef vector<ll> vl;

typedef set<int> si;
typedef set<ll> sl;
typedef set<char> sc;

typedef map<char, int> mci;

void solve() {
	string s;
	cin >> s;

	vector<vl> dp(123, vl(MAXALP * 100 + 1223));
	dp[ 0 ][ 0 ] = 1;

	for(int i = 1; i <= s.size(); i++) {
		for(int j = 0; j < MAXALP * 100 + 1223; j++) {
			for(int k = 0; k < MAXALP; k++) {
				if(j - k >= 0) dp[ i ][ j ] += dp[ i - 1 ][ j - k ];
				dp[ i ][ j ] %= mod;
			}
		}
	}

	int sum = 0;
	for(int i = 0; i < s.size(); i++) {
		sum += s[ i ] - 'a';
	}

	cout << dp[ s.size() ][ sum ] - 1 << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int q = 1;
	cin >> q;

	while(q--) {
		solve();
	}
}


/*
	DartemO_o :) govnavagon/comment
*/

#include <bits/stdc++.h>

#pragma optimize("Ofast")

using namespace std;

#define pr printf
#define re return

#define fi first
#define se second
#define in insert
#define eb emplace_back
#define ar array
#define deb(x)
#define all(x) x.begin(), x.end()

using ll = long long;

const int mod = int(1e9 + 7);
const int MAXI = 2 * int(1e5) + 123;
const int MAXALP = 26;
const int SOMAX = MAXALP * 100 + 1223;

typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;

typedef vector<int> vi;
typedef vector<ll> vl;

typedef set<int> si;
typedef set<ll> sl;
typedef set<char> sc;

typedef map<char, int> mci;

vector<vl> dp;

void solve() {
	string s;
	cin >> s;

	int sum = 0;
	for(int i = 0; i < s.size(); i++) {
		sum += s[ i ] - 'a';
	}

	cout << dp[ s.size() ][ sum ] - 1 << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	dp = vector<vl>(123, vl(SOMAX));
	dp[ 0 ][ 0 ] = 1;

	for(int i = 1; i < 123; i++) {
		for(int j = 0; j < SOMAX; j++) {
			for(int k = 0; k < MAXALP; k++) {
				if(j - k >= 0) dp[ i ][ j ] += dp[ i - 1 ][ j - k ];
				dp[ i ][ j ] %= mod;
			}
		}
	}

	int q = 1;
	cin >> q;

	while(q--) {
		solve();
	}
}


/*
	DartemO_o :) govnavagon/comment
*/

#include <bits/stdc++.h>

#pragma optimize("Ofast")

using namespace std;

#define pr printf
#define re return

#define fi first
#define se second
#define in insert
#define eb emplace_back
#define ar array
#define deb(x)
#define all(x) x.begin(), x.end()

using ll = long long;

const int mod = int(1e9 + 7);
const int MAXI = 2 * int(1e5) + 123;
const int MAXALP = 26;

typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<int, ll> pil;
typedef pair<ll, ll> pll;

typedef vector<int> vi;
typedef vector<ll> vl;

typedef set<int> si;
typedef set<ll> sl;
typedef set<char> sc;

typedef map<char, int> mci;

void solve() {
	string s;
	cin >> s;

	vector<vl> dp(100, vl(MAXALP * 100 + 1223));
	dp[ 0 ][ 0 ] = 1;

	for(int i = 1; i <= s.size(); i++) {
		for(int j = 0; j < MAXALP * 100 + 1223; j++) {
			for(int k = 0; k < MAXALP; k++) {
				if(j - k >= 0) dp[ i ][ j ] += dp[ i - 1 ][ j - k ];
				dp[ i ][ j ] %= mod;
			}
		}
	}

	int sum = 0;
	for(int i = 0; i < s.size(); i++) {
		sum += s[ i ] - 'a';
	}

	cout << dp[ s.size() ][ sum ] - 1 << '\n';
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int q = 1;
	cin >> q;

	while(q--) {
		solve();
	}
}


#include <bits/stdc++.h>
using namespace std;

#define all(x) x.begin(), x.end()
#define endl '\n'
#define fastIO ios::sync_with_stdio(0); cout.tie(0); cin.tie(0); cout.precision(10)
#define fi first
#define len(x) int(x.length())
#define mp make_pair
#define pb emplace_back
#define re return
#define se second
#define sz(x) int(x.size())
typedef long double ld;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<pair<int, int>> vii;
typedef vector<string> vs;
typedef vector<vector<int>> vvi;

vector<vll> dp(101, vll(2501));
ll MOD = 1000000007;

void prep()
{
	dp[0][0] = 1;
	for (int i = 1; i <= 100; i++) {
		for (int j = 0; j <= 2500; j++) {
			for (int k = 0; k < 26; k++) {
				if (j - k < 0) break;
				dp[i][j] += dp[i - 1][j - k];
			}
			dp[i][j] %= MOD;
		}
	}
}

int main() {
	fastIO;
	prep();
	int t;
	cin >> t;
	while (t-- > 0) {
		string s;
		cin >> s;
		int len = len(s), sum = 0;
		for (int i = 0; i < len; i++) {
			sum += s[i] - 'a';
		}
		if (dp[len][sum] == 0) cout << MOD - 1 << endl;
		else cout << dp[len][sum] - 1 << endl;
	}
	return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fi first
#define se second
#define pb push_back
#define bc back
#define inf 0x3f3f3f3f
const ull p = 19260817;
const int N = 1e6 + 7;
const int M = 4e3 + 7;
typedef double db;
const db pi = acos(-1.0);
const int mod = 1e9 + 7;

ll dp[101][2607];
string s;
int main() {
#ifdef local
    freopen("in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    dp[0][0] = 1;
    for(int i = 1; i <= 100; i++) {
        for(int j = 2500; ~j; j--) {
            for(int k = 0; k < 26 && k <= j; k++)
                (dp[i][j] += dp[i - 1][j - k]) %= mod;
        }
    }

    while(T--) {
        cin >> s;
        int n = 0;
        for(int i = 0; i < int(s.size()); i++)
            n += s[i] - 'a';
        cout << (dp[s.size()][n] + mod - 1) % mod << endl;
    }
    return 0;
}


#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
typedef long long ll;
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/hash_policy.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
#define fi first
#define se second
#define pb push_back
#define bc back
#define inf 0x3f3f3f3f
const ull p = 19260817;
const int N = 1e6 + 7;
const int M = 4e3 + 7;
typedef double db;
const db pi = acos(-1.0);
const int mod = 1e9 + 7;

ll dp[2607];
string s;
int main() {
#ifdef local
    freopen("in.txt", "r", stdin);
#endif
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T;
    cin >> T;
    while(T--) {
        cin >> s;
        int n = 0;
        for(int i = 0; i < int(s.size()); i++)
            n += s[i] - 'a';
        memset(dp, 0, sizeof dp);
        dp[0] = 1;
        for(int i = 0; i < int(s.size()); i++) {
            for(int j = n; j; j--) {
                for(int k = 1; k < 26 && k <= j; k++)
                    (dp[j] += dp[j - k]) %= mod;
            }
        }
        cout << (dp[n] + mod - 1) % mod << endl;
    }
    return 0;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma comment(linker, "/STACK:5000000000")
//#pragma GCC optimize "-O3"
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <class T>
istream& operator >> (istream& in, vector<T>& v){ for(auto& e : v){ in >> e;} return in;}
template <class T>
istream& operator >> (istream& in, vector<pair<T, T> >& v){ for(auto& e : v){ in >> e.first >> e.second;} return in;}

#define int long long
//#define int short int
#define pb push_back
#define mkp make_pair
#define X first
#define Y second
#define cont continue
#define ret return
#define For(i, a, b) for (int i = a; i < b;i++)
#define forn(i, a) for (int i = 0;i < a;i++)
#define ford(i, a, b) for (int i = b - 1;i >= a;i--)
#define fordn(i, a) for (int i = a - 1;i >= 0;i--)
#define forr(x, arr) for(auto &x: arr)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define REE(s_) {cout << s_ << '\n';exit(0);}
#define makeunique(x) sort(all(x)), (x).resize(unique(all(x)) - (x).begin())
#ifdef debug
    #define deb(a) cout << "\n[" << #a << "] == " << a << endl;
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const vector<T>& v){ out << "[";for(int i = 0;i < v.size();i++){out << v[i];if (i != v.size() - 1) out << " ";} out << "]"; return out; }
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const pair<T, T>& v){ out << "[";out << v.first << ", " << v.second;out << "]"; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const set<T>& v){out << "["; for(auto i = v.begin();i != v.end();i++){ out << *i; if (*i != *v.rbegin()) out << ", ";} out << "]"; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const multiset<T>& v){out << "["; for(auto i = v.begin();i != v.end();i++){ out << *i; if (*i != *v.rbegin()) out << ", ";} out << "]"; return out;}
#else
    #define deb(a)
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const vector<T>& v){ for(auto& e : v){ out << e << d;} return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const pair<T, T> & v){ out << v.X << d << v.Y; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const set<T>& v){ for(auto& e : v){ out << e << d;} return out;}
#endif
typedef long long ll;
typedef long double ldd;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef set<int> si;
typedef set<pii> spii;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <typename T> string toString(T val){ostringstream oss; oss << val; return oss.str();}
template<typename T> T sqr(T a) {return a * a;}
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
//const int dx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
//const int dy[8] = {1, -1, 1, 0, -1, 1, 0, -1};
//const int dx[8] = {-2, -2, 1, 1, -1, -1, 2, 2};
//const int dy[8] = {-1, 1, -2, 2, -2, 2, -1, 1};
const ldd eps = 1e-13;
const int mod = 1e9 + 7;;
const ldd pi = acos(-1.);
//const int MAX_MEM = 1e8;
//int mpos = 0;
//char mem[MAX_MEM];
//inline void * operator new ( size_t n ) {
//    assert((mpos += n) <= MAX_MEM);
//    return (void *)(mem + mpos - n);
//}
//inline void operator delete ( void * ) noexcept { }
//void add(int &x, int y, int mod){
//    x %= mod;
//    y %= mod;
//    x = (x + y) % mod;
//    if (x < 0) x += mod;
//}
//
//void sub(int &x, int y, int mod){
//    x = (x - y) % mod;
//    if (x < 0) x += mod;
//}
//
//int mulq(int a, int b, int mod){
//    int res = 0;
//    a %= mod;
//    while(b){
//        if (b & 1){
//            add(res, a, mod);
//        }
//        b >>= 1;
//        add(a, a, mod);
//    }
//    return res;
//}
//
//int powq(int a, int b, int mod) {
//    int res = 1;
//    a %= mod;
//    while(b){
//        if (b & 1){
//            res = mulq(res, a, mod);
//        }
//        b >>= 1;
//        a = mulq(a, a, mod);
//    }
//    return res;
//}

//jillzay, jillzay, paci, paci, gilzi, gilzi

struct pos{
    int b, k, ind;
};

int was[3000][101];
int dp[3000][101];
map<pii, int> used;
int calc(int sum, int cnt){
    if (sum == 0) return 1;
    if (cnt == 0 || sum < 0) return 0;
    if (was[sum][cnt]) return dp[sum][cnt];
    was[sum][cnt] = 1;
    int &ans = dp[sum][cnt];
    forn(i, 26){
        (ans += calc(sum - i, cnt - 1)) %= mod;
    }
    return ans;
}

void solve(){
    memset(was, 0, sizeof was);
    memset(dp, 0, sizeof dp);
    string s;
    cin >> s;
    int su = 0;
    forr(i, s) su += i - 'a';
    if (used.find({su, s.size()}) != used.end()){
        cout << used[{su, s.size()}] << '\n';
        return;
    }
    int ans = calc(su, s.size()) - 1;
    if (ans < 0) ans += mod;
    ans %= mod;
    used[{su, s.size()}] = ans;
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    #ifdef KULA
            freopen("input.txt", "r", stdin);
//            freopen("output.txt", "w", stdout);
    #else
//            freopen("input.txt", "r", stdin);
//            freopen("output.txt", "w", stdout);
    #endif

    int t;
    t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma comment(linker, "/STACK:5000000000")
//#pragma GCC optimize "-O3"
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <class T>
istream& operator >> (istream& in, vector<T>& v){ for(auto& e : v){ in >> e;} return in;}
template <class T>
istream& operator >> (istream& in, vector<pair<T, T> >& v){ for(auto& e : v){ in >> e.first >> e.second;} return in;}

#define int long long
//#define int short int
#define pb push_back
#define mkp make_pair
#define X first
#define Y second
#define cont continue
#define ret return
#define For(i, a, b) for (int i = a; i < b;i++)
#define forn(i, a) for (int i = 0;i < a;i++)
#define ford(i, a, b) for (int i = b - 1;i >= a;i--)
#define fordn(i, a) for (int i = a - 1;i >= 0;i--)
#define forr(x, arr) for(auto &x: arr)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define REE(s_) {cout << s_ << '\n';exit(0);}
#define makeunique(x) sort(all(x)), (x).resize(unique(all(x)) - (x).begin())
#ifdef debug
    #define deb(a) cout << "\n[" << #a << "] == " << a << endl;
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const vector<T>& v){ out << "[";for(int i = 0;i < v.size();i++){out << v[i];if (i != v.size() - 1) out << " ";} out << "]"; return out; }
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const pair<T, T>& v){ out << "[";out << v.first << ", " << v.second;out << "]"; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const set<T>& v){out << "["; for(auto i = v.begin();i != v.end();i++){ out << *i; if (*i != *v.rbegin()) out << ", ";} out << "]"; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const multiset<T>& v){out << "["; for(auto i = v.begin();i != v.end();i++){ out << *i; if (*i != *v.rbegin()) out << ", ";} out << "]"; return out;}
#else
    #define deb(a)
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const vector<T>& v){ for(auto& e : v){ out << e << d;} return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const pair<T, T> & v){ out << v.X << d << v.Y; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const set<T>& v){ for(auto& e : v){ out << e << d;} return out;}
#endif
typedef long long ll;
typedef long double ldd;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef set<int> si;
typedef set<pii> spii;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <typename T> string toString(T val){ostringstream oss; oss << val; return oss.str();}
template<typename T> T sqr(T a) {return a * a;}
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
//const int dx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
//const int dy[8] = {1, -1, 1, 0, -1, 1, 0, -1};
//const int dx[8] = {-2, -2, 1, 1, -1, -1, 2, 2};
//const int dy[8] = {-1, 1, -2, 2, -2, 2, -1, 1};
const ldd eps = 1e-13;
const int mod = 1e9 + 7;;
const ldd pi = acos(-1.);
//const int MAX_MEM = 1e8;
//int mpos = 0;
//char mem[MAX_MEM];
//inline void * operator new ( size_t n ) {
//    assert((mpos += n) <= MAX_MEM);
//    return (void *)(mem + mpos - n);
//}
//inline void operator delete ( void * ) noexcept { }
//void add(int &x, int y, int mod){
//    x %= mod;
//    y %= mod;
//    x = (x + y) % mod;
//    if (x < 0) x += mod;
//}
//
//void sub(int &x, int y, int mod){
//    x = (x - y) % mod;
//    if (x < 0) x += mod;
//}
//
//int mulq(int a, int b, int mod){
//    int res = 0;
//    a %= mod;
//    while(b){
//        if (b & 1){
//            add(res, a, mod);
//        }
//        b >>= 1;
//        add(a, a, mod);
//    }
//    return res;
//}
//
//int powq(int a, int b, int mod) {
//    int res = 1;
//    a %= mod;
//    while(b){
//        if (b & 1){
//            res = mulq(res, a, mod);
//        }
//        b >>= 1;
//        a = mulq(a, a, mod);
//    }
//    return res;
//}

//jillzay, jillzay, paci, paci, gilzi, gilzi

struct pos{
    int b, k, ind;
};

int was[3000][101];
int dp[3000][101];

int calc(int sum, int cnt){
    if (sum == 0) return 1;
    if (cnt == 0 || sum < 0) return 0;
    if (was[sum][cnt]) return dp[sum][cnt];
    was[sum][cnt] = 1;
    int &ans = dp[sum][cnt];
    forn(i, 26){
        (ans += calc(sum - i, cnt - 1)) %= mod;
    }
    return ans;
}

void solve(){
    memset(was, 0, sizeof was);
    memset(dp, 0, sizeof dp);
    string s;
    cin >> s;
    int su = 0;
    forr(i, s) su += i - 'a';
    int ans = calc(su, s.size()) - 1;
    if (ans < 0) ans += mod;
    ans %= mod;
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    #ifdef KULA
            freopen("input.txt", "r", stdin);
//            freopen("output.txt", "w", stdout);
    #else
//            freopen("input.txt", "r", stdin);
//            freopen("output.txt", "w", stdout);
    #endif

    int t;
    t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}


#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#pragma comment(linker, "/STACK:5000000000")
//#pragma GCC optimize "-O3"
//#pragma GCC optimize("Ofast,no-stack-protector")
//#pragma GCC target("mmx,avx,fma")
//#pragma GCC optimize ("unroll-loops")

using namespace __gnu_pbds;
using namespace std;

template <class T>
istream& operator >> (istream& in, vector<T>& v){ for(auto& e : v){ in >> e;} return in;}
template <class T>
istream& operator >> (istream& in, vector<pair<T, T> >& v){ for(auto& e : v){ in >> e.first >> e.second;} return in;}

#define int long long
//#define int short int
#define pb push_back
#define mkp make_pair
#define X first
#define Y second
#define cont continue
#define ret return
#define For(i, a, b) for (int i = a; i < b;i++)
#define forn(i, a) for (int i = 0;i < a;i++)
#define ford(i, a, b) for (int i = b - 1;i >= a;i--)
#define fordn(i, a) for (int i = a - 1;i >= 0;i--)
#define forr(x, arr) for(auto &x: arr)
#define all(x) x.begin(),x.end()
#define rall(x) x.rbegin(),x.rend()
#define REE(s_) {cout << s_ << '\n';exit(0);}
#define makeunique(x) sort(all(x)), (x).resize(unique(all(x)) - (x).begin())
#ifdef debug
    #define deb(a) cout << "\n[" << #a << "] == " << a << endl;
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const vector<T>& v){ out << "[";for(int i = 0;i < v.size();i++){out << v[i];if (i != v.size() - 1) out << " ";} out << "]"; return out; }
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const pair<T, T>& v){ out << "[";out << v.first << ", " << v.second;out << "]"; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const set<T>& v){out << "["; for(auto i = v.begin();i != v.end();i++){ out << *i; if (*i != *v.rbegin()) out << ", ";} out << "]"; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const multiset<T>& v){out << "["; for(auto i = v.begin();i != v.end();i++){ out << *i; if (*i != *v.rbegin()) out << ", ";} out << "]"; return out;}
#else
    #define deb(a)
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const vector<T>& v){ for(auto& e : v){ out << e << d;} return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const pair<T, T> & v){ out << v.X << d << v.Y; return out;}
    template <char d = ' ', class T>
    ostream& operator << (ostream& out, const set<T>& v){ for(auto& e : v){ out << e << d;} return out;}
#endif
typedef long long ll;
typedef long double ldd;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef map<int, int> mii;
typedef map<string, int> msi;
typedef set<int> si;
typedef set<pii> spii;
typedef tree<int,null_type,less_equal<int>,rb_tree_tag,tree_order_statistics_node_update> indexed_set;
template<class T> bool uin(T &a, T b) { return a > b ? (a = b, true) : false; }
template<class T> bool uax(T &a, T b) { return a < b ? (a = b, true) : false; }
template <typename T> string toString(T val){ostringstream oss; oss << val; return oss.str();}
template<typename T> T sqr(T a) {return a * a;}
mt19937 gen(chrono::high_resolution_clock::now().time_since_epoch().count());
const int dx[4] = {0, 1, 0, -1};
const int dy[4] = {1, 0, -1, 0};
//const int dx[8] = {0, 0, 1, 1, 1, -1, -1, -1};
//const int dy[8] = {1, -1, 1, 0, -1, 1, 0, -1};
//const int dx[8] = {-2, -2, 1, 1, -1, -1, 2, 2};
//const int dy[8] = {-1, 1, -2, 2, -2, 2, -1, 1};
const ldd eps = 1e-13;
const int mod = 1e9 + 7;;
const ldd pi = acos(-1.);
//const int MAX_MEM = 1e8;
//int mpos = 0;
//char mem[MAX_MEM];
//inline void * operator new ( size_t n ) {
//    assert((mpos += n) <= MAX_MEM);
//    return (void *)(mem + mpos - n);
//}
//inline void operator delete ( void * ) noexcept { }
//void add(int &x, int y, int mod){
//    x %= mod;
//    y %= mod;
//    x = (x + y) % mod;
//    if (x < 0) x += mod;
//}
//
//void sub(int &x, int y, int mod){
//    x = (x - y) % mod;
//    if (x < 0) x += mod;
//}
//
//int mulq(int a, int b, int mod){
//    int res = 0;
//    a %= mod;
//    while(b){
//        if (b & 1){
//            add(res, a, mod);
//        }
//        b >>= 1;
//        add(a, a, mod);
//    }
//    return res;
//}
//
//int powq(int a, int b, int mod) {
//    int res = 1;
//    a %= mod;
//    while(b){
//        if (b & 1){
//            res = mulq(res, a, mod);
//        }
//        b >>= 1;
//        a = mulq(a, a, mod);
//    }
//    return res;
//}

//jillzay, jillzay, paci, paci, gilzi, gilzi

struct pos{
    int b, k, ind;
};

int was[3000][101];
int dp[3000][101];
map<pii, int> used;
int calc(int sum, int cnt){
    if (sum == 0) return 1;
    if (cnt == 0 || sum < 0) return 0;
    if (was[sum][cnt]) return dp[sum][cnt];
    was[sum][cnt] = 1;
    int &ans = dp[sum][cnt];
    forn(i, 26){
        (ans += calc(sum - i, cnt - 1)) %= mod;
    }
    return ans;
}

void solve(){
//    memset(was, 0, sizeof was);
//    memset(dp, 0, sizeof dp);
    string s;
    cin >> s;
    int su = 0;
    forr(i, s) su += i - 'a';
    if (used.find({su, s.size()}) != used.end()){
        cout << used[{su, s.size()}] << '\n';
        return;
    }
    int ans = calc(su, s.size()) - 1;
    if (ans < 0) ans += mod;
    ans %= mod;
    used[{su, s.size()}] = ans;
    cout << ans << '\n';
}

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    #ifdef KULA
            freopen("input.txt", "r", stdin);
//            freopen("output.txt", "w", stdout);
    #else
//            freopen("input.txt", "r", stdin);
//            freopen("output.txt", "w", stdout);
    #endif

    int t;
    t = 1;
    cin >> t;
    while(t--){
        solve();
    }
    return 0;
}


#pragma GCC optimize("O3")
//#pragma GCC target("avx")
#include <bits/stdc++.h>
using namespace std;
#define re return
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define make_unique(x) sort(all(x)),x.resize(unique(all(x))-x.begin())
#define fi first
#define se second
#define ss second.second
#define sf second.first
#define ff first.first
#define fs first.second
#define sqrt(x) sqrt(abs(x))
#define mp make_pair
#define PI 3.14159265358979323846
#define E 2.71828182845904523536
#define er erase
#define in insert
#define fo(i,n) for((i)=0;(i)<(n);(i)++)
#define ro(i,n) for((i)=n-1;(i)>=0;(i)--)
#define fr(i,j,n) for((i)=(j);(i)<(n);(i)++)
#define rf(i,j,n) for((i)=((n)-1);(i)>=(j);(i)--)
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
    const int N=(int)1e5+100;
    const int M=(int)2e6+100;
    const int inf=(int)1e9+100;
#define filename ""
    bool was[101][2600];
    ll table[101][2600];
    string s;
    ll mod=(ll)1e9+7;
ll f(int x,int y)
{
    if (y<0) re 0;
    if (!y) re 1;
    if (!x)
    {
        re 0;
    }
    if (was[x][y]) re table[x][y];
    was[x][y]=1;
    ll o=0;
    int i;
    fo(i,26)
    {
        o+=f(x-1,y-i);
        o%=mod;
    }
    re table[x][y]=o;
}
int main()
{
    //freopen("input.txt","r",stdin);
    //freopen("output.txt","w",stdout);
    //freopen(filename".in","r",stdin);
    //freopen(filename".out","w",stdout);
    //freopen("ans.txt","w",stdout);
    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
    srand(time(0));
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    int T;
    cin>>T;
    while(T--)
    {
        cin>>s;
        int i,sum=0;
        fo(i,s.length())
        {
            sum+=s[i]-'a';
        }
        cout<<(f(s.length(),sum)-1+mod)%mod<<'\n';
    }
}


// #pragma GCC optimize("Ofast,unroll-loops")
// #pragma GCC target("avx,avx2,fma")

#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define ull unsigned long long
#define dd double
#define ld long double
#define sl(n) scanf("%lld", &n)
#define si(n) scanf("%d", &n)
#define sd(n) scanf("%lf", &n)
#define pll pair <ll, ll>
#define pii pair <int, int>
#define mp make_pair
#define pb push_back
#define all(v) v.begin(), v.end()
#define inf (1LL << 61)
#define loop(i, start, stop, inc) for(ll i = start; i <= stop; i += inc)
#define for1(i, stop) for(ll i = 1; i <= stop; ++i)
#define for0(i, stop) for(ll i = 0; i < stop; ++i)
#define rep1(i, start) for(ll i = start; i >= 1; --i)
#define rep0(i, start) for(ll i = (start-1); i >= 0; --i)
#define ms(n, i) memset(n, i, sizeof(n))
#define casep(n) printf("Case %lld:", ++n)
#define pn printf("\n")
#define pf printf
#define EL '\n'
#define fastio std::ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

const ll sz = 105, mod = 1e9 + 7;
char s[sz];

ll dp[sz][sz*25];

ll solve(ll pos, ll sum)
{
    if(sum < 0)
        return 0;

    if(pos == 0)
        return sum == 0;

    ll &ret = dp[pos][sum];
    if(ret != -1)
        return ret;

    ret = 0;
    for0(i, 26) {
        ret += solve(pos-1, sum-i);

        if(ret >= mod) ret -= mod;
    }

    return ret;
}

int main()
{
    ll t;
    cin >> t;

    ms(dp, -1);

    while(t--) {
        scanf("%s", s+1);
        ll len = strlen(s+1);

        ll tot = 0;
        for1(i, len) tot += (s[i] - 'a');

        ll ans = solve(len, tot) - 1;
        if(ans < 0) ans += mod;

        pf("%lld\n", ans);
    }

    return 0;
}


//Sani buyuk Osman Pasa Plevneden cikmam diyor.
//FatihSultanMehmedHan
//Abdulhamid Han
//Bismillahirrahmanirrahim
//█▀█─█──█──█▀█─█─█
//█▄█─█──█──█▄█─█▄█
//█─█─█▄─█▄─█─█─█─█

#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

#include <bits/stdc++.h>

using namespace std;

typedef long long lo;
typedef pair< int,int > PII;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define FOR for(int i=1;i<=n;i++)
#define mid ((start+end)/2)
#define ort ((bas+son)/2)

const lo MAX = -1000000000000000000;
const lo MIN = 1000000000000000000;
const lo inf = 1000000000;
const lo KOK = 100000;
const lo LOG = 30;
const lo li = 500005;
const lo mod = 1000000007;

int n,m,b[li],a[li],k,flag,t,dp[105][4005];
int cev;
char s[li];
vector<int> v;

inline int add(int x,int y){
	if(x+y>=mod)return x+y-mod;
	return x+y;
}

int main(void){
	fio();
	dp[0][0]=1;
	for(int i=0;i<=100;i++){
		for(int j=0;j<=100*26;j++){
			if(dp[i][j]==0)continue;
			for(int yer=0;yer+j<=100*26 && yer<26;yer++){
				dp[i+1][j+yer]=add(dp[i+1][j+yer],dp[i][j]);
			}
		}
	}
	cin>>t;
	while(t--){
		cin>>(s+1);
		int l=strlen(s+1);
		int say=0;
		for(int i=1;i<=l;i++){
			say+=s[i]-'a';
		}
		cout<<dp[l][say]-1<<endl;
	}
	return 0;
}