#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
typedef double LF;
typedef complex<LF> cd;

#define clr(x, y) memset(x, y, sizeof(x))
#define INF 0x7fffffff

const int MAXN = 2e5 + 15;

char ch[MAXN];
int n, nxt[MAXN], T;
LL l, r, f[MAXN][35];

inline int read(){
	int r = 0, z = 1; char ch = getchar();
	while(ch < '0' || ch > '9'){if(ch == '-') z = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9'){r = r * 10 + ch - '0'; ch = getchar();}
	return r * z;
}

LL ff(LL len, int c){
	if(len <= n) return f[len][c];
	if(len <= n * 2) return f[n][c] + f[len - n][c];
	LL f1 = f[n][c], f2 = f[n][c] + f[T][c], l1 = n, l2 = n + T;
	while(len > l1 + l2){
		LL t = f2;
		f2 += f1; f1 = t;
		t = l2; l2 += l1; l1 = t;
	}
	return f2 + ff(len - l2, c);
}

LL calc(LL len, int c){
	if(len <= n) return f[len][c];
	if(len <= n * 2) return f[n][c] + f[len - n][c];
	if(n % T == 0){
		LL tmp = (len - 1ll * n) / T * f[T][c] + f[n][c];
		len -= n; len %= T;
		return tmp + f[len][c];
	}
	return ff(len, c);
}

void work(){
	scanf("%s %lld %lld", ch + 1, &l, &r); n = strlen(ch + 1) / 2;
	for(int i = 1; i <= n; i ++){
		for(int j = 0; j < 26; j ++) f[i][j] = f[i - 1][j];
		f[i][ch[i] - 'a'] ++;
	} nxt[1] = 0;
	for(int i = 2, j = 0; i <= n; i ++){
		for(; j && ch[j + 1] != ch[i];) j = nxt[j];
		if(ch[j + 1] == ch[i]) j ++;
		nxt[i] = j;
	}
	T = n - nxt[n];
	for(int i = 0; i < 26; i ++) printf("%lld ", calc(r, i) - calc(l - 1, i));
}

int main(){
	work();
	return 0;
}
