#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int kmp[200010],len;
char s[200010];
ll p,l,r;
ll sum[30][200010];
ll solve(ll L,int n) {
	if(L<=len) return sum[n][L];
	ll s1=sum[n][p],s2=sum[n][len],l1=p,l2=len,x,y;
	while(l1+l2<L){
		x=s2,y=l2;
		s2+=s1,l2+=l1;
		s1=x,l1=y;
	}
	return s2+solve(L-l2,n);
}
int main(){
	scanf("%s%lld%lld",s+1,&l,&r);
	len=strlen(s+1)/2;
	for(int i=2,j=0;i<=len;i++){     
        while(j&&s[i]!=s[j+1]) j=kmp[j];    
        if(s[j+1]==s[i]) j++;    
    	kmp[i]=j;
    	//cout<<i<<" "<<kmp[i]<<endl;
    }
	p=len-kmp[len];
	for(int i=0;i<26;i++) 
	for(int j=1;j<=len;j++){
		sum[i][j]=sum[i][j-1];
		if(s[j]-'a'==i) sum[i][j]++;
	}
	for(int i=0;i<26;i++) 
	printf("%lld ",solve(r,i)-solve(l-1,i));
}