#include<bits/stdc++.h>
#define sqr(x) ((x)*(x))
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define ld long double
#define vi vector<int>
#define HEAP(...) priority_queue<__VA_ARGS__ >
#define heap(...) priority_queue<__VA_ARGS__,vector<__VA_ARGS__ >,greater<__VA_ARGS__ > > 
#define pii pair<int,int> 
#define pb push_back
#define mp make_pair
#define debuge cerr<<"isok"<<endl
#define debug(x) cerr<<#x<<"="<<x<<endl
#define dprintf(...) fprintf(stderr,__VA_ARGS__)
#define SS second
#define FF first
#define ls (k<<1)
#define rs (k<<1|1)
#define clr(a,x) memset(a,x,sizeof(a))
#define cpy(a,x) memcpy(a,x,sizeof(a))
#define file(x) freopen(x".in","r",stdin),freopen(x".out","w",stdout)
#define SZ(x) ((int)x.size())
using namespace std;
template<class T> inline void gmin(T &x,const T &y){if(x>y) x=y;}
template<class T> inline void gmax(T &x,const T &y){if(x<y) x=y;}
const int BufferSize=1<<16;
char buffer[BufferSize],*Bufferhead,*Buffertail;
bool Terminal;
inline char Getchar(){
	if(Bufferhead==Buffertail){
		int l=fread(buffer,1,BufferSize,stdin);
		if(!l){Terminal=1;return 0;}
		Buffertail=(Bufferhead=buffer)+l;
	}
	return *Bufferhead++;
}
template<class T>inline bool read(T &x){
	x=0;char c=Getchar(),rev=0;
	while(c<'0'||c>'9'){rev|=c=='-';c=Getchar();if(Terminal)return 0;}
	while(c>='0'&&c<='9') x=x*10+c-'0',c=Getchar();
	if(c=='.'){
		c=Getchar();double t=0.1;
		while(c>='0'&&c<='9') x=x+(c-'0')*t,c=Getchar(),t=t/10;
	}
	x=rev?-x:x;
	return 1;
}
template<class T1,class T2> inline bool read(T1 &x,T2 &y){return read(x)&read(y);}
template<class T1,class T2,class T3> inline bool read(T1 &x,T2 &y,T3 &z){return read(x)&read(y)&read(z);}
template<class T1,class T2,class T3,class T4> inline bool read(T1 &x,T2 &y,T3 &z,T4 &w){return read(x)&read(y)&read(z)&read(w);}
inline bool reads(char *x){
	char c=Getchar();
	while(c<33||c>126){c=Getchar();if(Terminal)return 0;}
	while(c>=33&&c<=126) (*x++)=c,c=Getchar();
	*x=0;return 1;
}
template<class T>inline void print(T x,const char c='\n'){
	if(!x){putchar('0');putchar(c);return;}
	if(x<0) putchar('-'),x=-x;
	int m=0,a[20];
	while(x) a[m++]=x%10,x/=10;
	while(m--) putchar(a[m]+'0');
	putchar(c);
}
//--------------------------------head---------------------------------------------

const int inf=0x3f3f3f3f;
const int N=2000005,M=100005,mod=1e9+7;
template<class T,class S> inline void ch(T &x,const S y){x=(x+y)%mod;}
inline int exp(int x,int y,const int mod=::mod){
	int ans=1;
	while(y){
		if(y&1) ans=(ll)ans*x%mod;
		x=(ll)x*x%mod;y>>=1;
	}return ans;
}

string str;
int n,sum[33];
ll l,r,a[205],ans[33];
inline int findnext(string s){
	static int fa[N];
	int n=s.length();
	for(int i=2,p=0;i<=n;i++){
		while(p&&s[p]!=s[i-1])p=fa[p];
		if(s[p]==s[i-1]) p++;
		fa[i]=p;
	}
	int k=n;
	while(k*2>=n) k=fa[k];
//	cerr<<s<<" "<<k<<endl;
	return k;
}
inline string make(string a){
	int n=a.length(),g=findnext(a);
	return a+a.substr(g,n-g*2);
}
set<pair<ll,ll> > s;
inline void ins(ll x,ll y){
	set<pair<ll,ll> >::iterator it=s.lower_bound(mp(x,0));
	if((*it).FF==x){
		s.insert(mp(x,(*it).SS+y));
		s.erase(it);
	}
	else s.insert(mp(x,y));
}
inline void solve(string b,ll m,int flag){
	if(!m) return ;
	s.clear();
	s.insert(mp(m,1));
	for(int i=n;i;i--){
		set<pair<ll,ll> >::iterator it=s.lower_bound(mp(a[i]+1,0));
		while(it!=s.end()){
			pair<ll,ll> tmp=*it;
			ll x=tmp.FF,y=tmp.SS;
			ins(a[i+1]/2,y);
			ins(x-a[i+1]/2,y);
			it++;s.erase(tmp);
		}
	}
	set<pair<ll,ll> >::iterator it=s.begin();
	clr(sum,0);
	for(int i=1,t=b.length();i<=t;i++){
		sum[b[i-1]-'a']++;
		while(it!=s.end()&&(*it).FF==i){
			for(int j=0;j<26;j++)
				ans[j]+=sum[j]*(*it).SS*flag;
			it++;
		}
	}
}

int main(){
#ifdef rqgao2014
	assert(freopen("input.txt","r",stdin));
#endif
	cin>>str>>l>>r;
	str=make(str);
	a[1]=str.length();
	a[2]=make(str).length();
	for(n=2;a[n]<r;) a[n+1]=a[n]+a[n-1],n++;
//	for(int i=1;i<=n;i++) dprintf("%lld ",a[i]);dprintf("\n");
	solve(str,r,1);
//	for(int i=0;i<26;i++)
//		printf("%lld ",ans[i]);puts("");
	solve(str,l-1,-1);
	for(int i=0;i<26;i++)
		printf("%lld ",ans[i]);puts("");
	return 0;
}

Measured memory_bytes: 2932