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<cstdio>
#include<cstring>
#include<algorithm>
#include<cassert>
#include<cmath>
#define ll long long
using namespace std;
inline ll read(){
	ll re=0,flag=1;char ch=getchar();
	while(ch>'9'||ch<'0'){
		if(ch=='-') flag=-1;
		ch=getchar();
	}
	while(ch>='0'&&ch<='9') re=(re<<1)+(re<<3)+ch-'0',ch=getchar();
	return re*flag;
}
char s[400010];
ll n,a[400010],cnt[110][26],fib[110],fail[400010],m,b[400010],ans[26],l,r;
void getb(){
	ll i,j=0;fail[0]=fail[1]=0;
	for(i=1;i<n;i++){
//		cout<<"enter kmp "<<i<<' '<<j<<' '<<a[i]<<' '<<a[j]<<'\n';
		while(a[i]!=a[j]&&j) j=fail[j];
		j+=(a[i]==a[j]);fail[i+1]=j;
	}
//	for(i=0;i<=n;i++) cout<<i<<' '<<fail[i]<<'\n';
	for(i=0;i<n-fail[n];i++) b[i]=a[i];
	m=n-fail[n];
}
void solve(ll lim,ll type){
	ll i,j;
//	cout<<"solve "<<lim<<' '<<type<<'\n';
	if(lim<=n){
		for(i=1;i<=lim;i++) ans[a[i]]+=type;
		return;
	}
	for(i=1;i<=100;i++){
		if(fib[i]<=lim) continue;
		for(j=0;j<26;j++) ans[j]+=cnt[i-1][j]*type;
		solve(lim-fib[i-1],type);break;
	}
}
void add(ll len,ll type){
	ll i,tot=len/m;
	for(i=1;i<=m;i++) ans[b[i]]+=tot*type;
	for(i=tot*m+1;i<=len;i++) ans[b[i-tot*m]]+=type;
} 
void another(){
	add(l-1,-1);add(r,1);
}
int main(){
//	freopen("1.txt","r",stdin);
	scanf("%s",s);n=strlen(s)>>1;ll i,j;
	l=read();r=read();
	for(i=0;i<n;i++) a[i]=s[i]-'a';
	getb();
	for(i=n;i>=1;i--) a[i]=a[i-1];
	for(i=m;i>=1;i--) b[i]=b[i-1];
//	if(n%m==0){
//		another();goto print;
//	}
	for(i=1;i<=n;i++) cnt[0][a[i]]+=1,cnt[1][a[i]]+=1;
	for(i=1;i<=m;i++) cnt[1][b[i]]+=1;
	fib[0]=n;fib[1]=(n+m);
	for(i=2;i<=100;i++){
		fib[i]=fib[i-1]+fib[i-2];
		for(j=0;j<=25;j++) cnt[i][j]=cnt[i-1][j]+cnt[i-2][j];
	}
//	for(i=0;i<26;i++) cout<<i<<' '<<cnt[0][i]<<' '<<cnt[1][i]<<'\n';
	solve(l-1,-1);
	solve(r,1);
	print:
	for(i=0;i<26;i++) printf("%lld ",ans[i]);
}
