#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <algorithm>
#define fo(i,a,b) for(int i=a;i<=b;i++)
#define fod(i,a,b) for(int i=a;i>=b;i--)
#define LL long long
#define N 200005
using namespace std;
int nx[N],n;
LL a[200][26],le[200],l,r;
char ch[N];
void kmp()
{
    int j=0;
    fo(i,2,n/2)
    {
        while(j&&ch[j+1]!=ch[i]) j=nx[j];
        if(ch[j+1]==ch[i]) j++;
        nx[i]=j;
    }
}
LL calc(int c,LL w)
{
    int id=1;
    if(le[id]>=w) 
    {
        int s=0;
        fo(i,1,w)
        {
            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++;
    }
    LL 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;
    fo(i,1,n/2) 
    {
        a[1][ch[i]-'a']++; 
        if(i<=le[0]) a[0][ch[i]-'a']++;
    }
    fo(i,0,25) printf("%lld ",calc(i,r)-calc(i,l-1));
}