#include <cstdio>
#include <algorithm>
#include <cstring> 

using namespace std;

const int N = 2e5 + 10;

int n, T, p[N];
char s[N];
long long L, R, num[N][30];

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

long long calc(long long len, int c) {
    if (len <= n) return num[len][c];
    if (n % T == 0) {
        long long re = 1ll * (len - n) / T * num[T][c] + num[n][c];
        len -= n, len %= T;
        return re + num[len][c];
    }
    else return fib(len, c);
}

int main() {
    scanf("%s%lld%lld", s + 1, &L, &R);
    n = strlen(s + 1) / 2;
    p[1] = 0;
    for (int j = 0, i = 2; i <= n; i ++) {
        for (; j && s[j + 1] != s[i];) j = p[j];
        if (s[j + 1] == s[i]) j ++;
        p[i] = j;
    }
    for (int i = 1; i <= n; i ++) {
        for (int j = 0; j < 26; j ++) num[i][j] = num[i - 1][j];
        num[i][s[i] - 'a'] ++;
    }
    T = n - p[n];
	for (int i = 0; i < 26; i ++) printf("%lld%c", fib(R, i) - fib(L - 1, i), i == 25 ? 10 : 32);
    return 0;
}