#include<iostream>
#include<cstring>
using namespace std;

int nx[200005],n;
long long a[200][26],le[200],l,r;
char ch[200005];

void kmp()
{
	int j=0;
	for(int i=2;i<=n/2;i++)
	{
		while(j&&ch[j+1]!=ch[i]) 
			j=nx[j];
		if(ch[j+1]==ch[i]) 
			j++;
		nx[i]=j;
	}
}

long long calc(int c,long long w)
{
	int id=1;
	if(le[id]>=w)
	{
		int s=0;
		for(int i=1;i<=w;i++)
		{
			if(ch[i]-'a'==c) 
				s++;
		}
		return s;
	}
	while(w>=le[id])
	{
		a[id+1][c]=a[id][c]+a[id-1][c];
		le[id+1]=le[id]+le[id-1];
		id++;
	}
	long long s=a[id-1][c];
	if(w==le[id-1]) 
		return s;
	else 
		return s+calc(c,w-le[id-1]);
}

int main()
{
	scanf("%s",ch+1);
	n=strlen(ch+1);
	kmp();
	cin>>l>>r;
	le[0]=n/2-nx[n/2];
	le[1]=n/2;
	for(int i=1;i<=n/2;i++)
	{
		a[1][ch[i]-'a']++;
		if(i<=le[0]) 
			a[0][ch[i]-'a']++;
	}
	for(int i=0;i<=25;i++) 
		printf("%lld ",calc(i,r)-calc(i,l-1));
}