#include<bits/stdc++.h>

using namespace std;

typedef long long LL;

const int MX=400005;
const LL MXP=1000000000000000000ll;

char s[MX];int n;int bd[MX];
int T;
LL len[201],cf[201][26];
LL c[MX][26];
int typ;
#define A(x,y) for(int iA=0;iA<26;iA++)x[iA]+=y[iA]
void ini(){
	bd[0]=0;
	n=strlen(s);
	for(int i=1;i<n;i++){
		int t=bd[i-1];
		while(t&&s[t]!=s[i])t=bd[t-1];
		bd[i]=(s[t]==s[i]?t+1:0);
	}
	int l=bd[n-1];
	while(l>=n/2)l=bd[l-1];
	n-=l;
	memset(s+n,0,sizeof(char)*l);
	cerr<<s<<endl;
	T=n-bd[n-1];//最小正周期 
	cerr<<T<<endl;
	for(int i=0;i<n;i++){
		if(i)memcpy(c[i],c[i-1],sizeof(c[i]));
		c[i][s[i]-'a']++;
	}
	if(bd[n-1]%T){//fib
		typ=0;
		len[1]=n,len[2]=n+T;
		for(int i=0;i<26;i++)memcpy(cf[1],c[n-1],sizeof(cf[1]));
		memcpy(cf[2],cf[1],sizeof(cf[1]));
		A(cf[2],c[T-1]);
		for(int i=3;;i++){
			len[i]=len[i-1]+len[i-2];
			memcpy(cf[i],cf[i-1],sizeof(cf[i-1]));
			A(cf[i],cf[i-2]);
			if(len[i]>MXP)break;
		}
	}else{//cycle
		typ=1;
	}
}
LL cal(LL x,int ch){
	if(!x)return 0;
	if(typ)return (x%T?c[x%T-1][ch]:0)+c[T-1][ch]*(x/T);
	else{
		if(x<=n)return c[x-1][ch];
		for(int i=1;;i++){
			if(len[i+1]>x)return cf[i][ch]+cal(x-len[i],ch);
		}
	}
}
int main(){
	cin>>s;
	ini();
	LL L,R;cin>>L>>R;
	for(int i=0;i<26;i++)cout<<cal(R,i)-cal(L-1,i)<<' ';
	cout<<endl;
	return 0;
}
