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 <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

string S[3];
ll L,R;
ll cnt[103][28];
ll dif[103][28];


vector<int> Zalgo(string s) {
	vector<int> v(1,s.size());
	for(int i=1,l=-1,r=-1;i<s.size();i++) {
		if(i<=r && v[i-l]<r-i+1) v.push_back(v[i-l]);
		else {
			l=i; r=(i>r)?i:(r+1);
			while(r<s.size() && s[r-i]==s[r]) r++;
			v.push_back((r--)-l);
		}
	}
	v.push_back(0);
	return v;
}
string nex(string S) {
	vector<int> V=Zalgo(S);
	
	int l;
	for(l=S.size()/2-1;l>=0;l--) {
		if(V[S.size()-l]>=l) return S.substr(0,S.size()-l)+S.substr(0,S.size()-l);
	}
}
vector<ll> hoge(ll v) {
	vector<ll> ret(26,0);
	int i;
	FOR(i,26) ret[i] = v/S[0].size()*cnt[0][i];
	v%=S[0].size();
	FOR(i,v) ret[S[0][i]-'a']++;
	return ret;
}

vector<ll> hoge2(ll V) {
	vector<ll> ret(26,0);
	int i,j;
	for(i=99;i>=2;i--) {
		if(V>=cnt[i][26]) {
			FOR(j,26) ret[j]+=cnt[i][j]-cnt[i-2][j]/2;
			V-=cnt[i][26]-cnt[i-2][26]/2;
		}
	}
	FOR(i,V) ret[S[2][i]-'a']++;
	return ret;
}


void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>S[0]>>L>>R;
	S[1]=nex(S[0]);
	S[2]=nex(S[1]);
	
	FORR(r,S[0]) cnt[0][r-'a']++;
	FORR(r,S[1]) cnt[1][r-'a']++;
	cnt[0][26]=S[0].size();
	cnt[1][26]=S[1].size();
	
	vector<ll> LL,RR;
	if(S[0].size()+S[2].size()==2*S[1].size()) {
		RR=hoge(R);
		LL=hoge(L-1);
	}
	else {
		for(i=2;i<=100;i++) {
			FOR(j,27) {
				cnt[i][j] = min(1LL<<60,cnt[i-1][j]+cnt[i-2][j]);
			}
		}
		RR=hoge2(R);
		LL=hoge2(L-1);
	}
	FOR(i,26) _P("%lld%c",RR[i]-LL[i],(i==25)?'\n':' ');
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n';
	FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	solve(); return 0;
}
