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<vector>
using namespace std;
typedef long long int64;
struct Hash
{
	int n;
	static const int64 moda=1000000007ll,modb=2147483647ll;
	vector<int64> a,b,p,q;
	Hash(const string &s):n(s.size()),a(n+1,0),b(n+1,0),p(n+1,1),q(n+1,1)
	{
		for(int i=0;i<n;i++)
		{
			a[i+1]=(a[i]*17+s[i])%moda;
			b[i+1]=(b[i]*19+s[i])%modb;
			p[i+1]=p[i]*17%moda;
			q[i+1]=q[i]*19%modb;
		}
	}
	pair<int64,int64> query(int l,int r){return make_pair((p[r-l]*a[l]-a[r]+moda)%moda,(q[r-l]*b[l]-b[r]+modb)%modb);}
};
int64 cnt[300000][33];
vector<int64> add(vector<int64> a,vector<int64> b)
{
	for(int i=0;i<26;i++)a[i]+=b[i];
	return a;
}
pair<vector<int64>,int64> f(int64 n,int64 l,vector<int64> left,int64 r,vector<int64> right)
{
	vector<int64> ans(26);
	if(l+r<=n)
	{
		int64 tot=l+r;
		vector<int64> sum=add(left,right);
		auto x=f(n,tot,sum,l,left);
		ans=add(ans,x.first);
		n=x.second;
	}
	if(l<=n)
	{
		ans=add(ans,left);
		n-=l;
	}
	return make_pair(ans,n);
}
int main()
{
	string s;
	int64 l,r,k=0;
	cin>>s>>l>>r;
	s=s.substr(0,s.size()>>1);l--;
	int64 n=s.size();
	Hash h(s);
	for(int i=0;i<n;i++)
		if(h.query(0,i)==h.query(n-i,n))k=i;
	for(int i=0;i<n;i++)
	{
		for(int j=0;j<26;j++)cnt[i+1][j]=cnt[i][j];
		cnt[i+1][s[i]-'a']++;
	}
	if(!k)
	{
		for(int i=0;i<26;i++)
		{
			cout<<cnt[n][i]*(r/n)+cnt[r%n][i]-cnt[n][i]*(l/n)-cnt[l%n][i];
			if(i==25)cout<<endl;
			else cout<<' ';
		}
		return 0;
	}
	vector<int64> left(26,0),right(26,0);
	for(int 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(int i=0;i<26;i++)
	{
		cout<<upper.first[i]+cnt[upper.second][i]-lower.first[i]-cnt[lower.second][i];
		if(i==25)cout<<endl;
		else cout<<' ';
	}
	return 0;
}