We will call a string that can be obtained by concatenating two equal strings an even string. For example, `xyzxyz` and `aaaaaa` are even, while `ababab` and `xyzxy` are not.

For a non-empty string S, we will define f(S) as the shortest even string that can be obtained by appending one or more characters to the end of S. For example, f(`abaaba`)=`abaababaab`. It can be shown that f(S) is uniquely determined for a non-empty string S.

You are given an even string S consisting of lowercase English letters. For each letter in the lowercase English alphabet, find the number of its occurrences from the l-th character through the r-th character of f^{10^{100}} (S).

Here, f^{10^{100}} (S) is the string f(f(f( ... f(S) ... ))) obtained by applying f to S 10^{100} times.

Constraints

* 2 \leq |S| \leq 2\times 10^5
* 1 \leq l \leq r \leq 10^{18}
* S is an even string consisting of lowercase English letters.
* l and r are integers.

Input

Input is given from Standard Input in the following format:


S
l r


Output

Print 26 integers in a line with spaces in between. The i-th integer should be the number of the occurrences of the i-th letter in the lowercase English alphabet from the l-th character through the r-th character of f^{10^{100}} (S).

Examples

Input

abaaba
6 10


Output

3 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0


Input

xx
1 1000000000000000000


Output

0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 1000000000000000000 0 0


Input

vgxgpuamkvgxgvgxgpuamkvgxg
1 1000000000000000000


Output

87167725689669676 0 0 0 0 0 282080685775825810 0 0 0 87167725689669676 0 87167725689669676 0 0 87167725689669676 0 0 0 0 87167725689669676 141040342887912905 0 141040342887912905 0 0
//Z Algorithm
#include<cstdio>
#include<cstring>
#include<valarray>
using namespace std;
pair<valarray<long long>,long long> f(long long n,long long l,const valarray<long long> &left,long long r,const valarray<long long> &right)
{
	valarray<long long> ans(26);
	if(l+r<=n)
	{
		auto x=f(n,l+r,left+right,l,left);
		ans+=x.first;
		n=x.second;
	}
	if(l<=n)ans+=left,n-=l;
	return make_pair(ans,n);
}
char s[300000];
long long cnt[300000][30],z[300000],n;
int main()
{
	scanf("%s",s+1);
	n=strlen(s+1)>>1;
	z[1]=n;
	long long l=1,r=1;
	for(long long i=2;i<=n;i++)
		if(i>r)
		{
			z[i]=0;
			while(z[i]+i<=n&&s[z[i]+i]==s[z[i]+1])z[i]++;
			if(z[i])l=i,r=i+z[i]-1;
		}
		else if(z[i-l+1]<r-i+1)z[i]=z[i-l+1];
		else
		{
			z[i]=r-i+1;
			while(z[i]+i<=n&&s[z[i]+i]==s[z[i]+1])z[i]++;
			l=i,r=i+z[i]-1;
		}
	for(long long i=1;i<=n;i++)
	{
		for(long long j=0;j<26;j++)cnt[i][j]=cnt[i-1][j];
		cnt[i][s[i]-'a']++;
	}
	long long k=0;
	for(long long i=n;i>1;i--)
		if(z[i]+i-1==n)k=z[i];
	scanf("%lld%lld",&l,&r);l--;
	if(!k)
	{
		for(long long i=0;i<26;i++)printf("%lld ",cnt[n][i]*(r/n)+cnt[r%n][i]-cnt[n][i]*(l/n)-cnt[l%n][i]);
		putchar('\n');
		return 0;
	}
	valarray<long long> left(26),right(26);
	for(long long i=0;i<26;i++)
	{
		left[i]=cnt[n-k][i];
		right[i]=cnt[n][i]-cnt[n-k][i];
	}
	auto lower=f(l,n-k,left,k,right),upper=f(r,n-k,left,k,right);
	for(long long i=0;i<26;i++)printf("%lld ",upper.first[i]-lower.first[i]+cnt[upper.second][i]-cnt[lower.second][i]);
	putchar('\n');
	return 0;
}