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
#include<iostream>
#include<cstring>
#include<valarray>
#define array valarray<long long>
using namespace std;
long long a[200011],b[200011],p[200011]={1},q[200011]={1},moda=1000000007,modb=2147483647,cnt[300000][27];
char s[300000];
pair<long long,long long> query(long long l,long long r){return make_pair((p[r-l]*a[l]-a[r]+moda)%moda,(q[r-l]*b[l]-b[r]+modb)%modb);}
pair<array,long long> f(long long n,long long l,const array &left,long long r,const array &right)
{
	array 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);
}
int main()
{
	long long l,r;
	string s;
	cin>>s>>l>>r;l--;
	s=s.substr(0,s.size()>>1);
	long long n=s.size();
	for(long long i=1;i<=n;i++)
	{
		a[i]=(a[i-1]*17+s[i-1]-'a')%moda;
		b[i]=(b[i-1]*19+s[i-1]-'a')%modb;
		p[i]=p[i-1]*17%moda;
		q[i]=q[i-1]*19%modb;
	}
	for(long long i=0;i<n;i++)
	{
		for(long long j=0;j<26;j++)cnt[i+1][j]=cnt[i][j];
		cnt[i+1][s[i]-'a']++;
	}
	long long k=0;
	for(long long i=0;i<n;i++)
		if(query(0,i)==query(n-i,n))k=i;
	if(!k)
	{
		for(long long i=0;i<26;i++)cout<<cnt[n][i]*(r/n)-cnt[n][i]*(l/n)+cnt[r%n][i]-cnt[l%n][i]<<' ';
		cout<<endl;
		return 0;
	}
	array 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++)cout<<upper.first[i]+cnt[upper.second][i]-lower.first[i]-cnt[lower.second][i]<<' ';
	cout<<endl;
	return 0;
}