/*Program from Luvwgyx*/
#include<cstdio>
#include<cstring>
#include<algorithm>
#define ll long long
using namespace std;
const ll  inf=1e18;
const int maxn=2e5+10;
const int maxm=1e2+10;
char s[maxn];int n,lst,nxt[maxn],pre[maxn][26];
ll l,r,cutpos,ans[26],fib[maxm],f[maxm][26];
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void print(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)print(x/10);
    putchar(x%10+'0');
}
void write(ll x){print(x);putchar(' ');}
void get_nxt(){
    nxt[1]=0;
    for(int i=2,j;i<=n;i++){
        j=nxt[i-1];
        while(j&&s[j+1]!=s[i])j=nxt[j];
        nxt[i]=s[j+1]==s[i]?j+1:0;
    }
}
void get_fib(){
    fib[1]=n;
    for(int i=1;i<=n;i++){f[1][s[i]-'a']++;f[2][s[i]-'a']++;}
    fib[2]=n+cutpos;
    for(int i=0;i<26;i++)f[2][i]+=pre[cutpos][i];
    for(int i=3;;i++){
        for(int j=0;j<26;j++)f[i][j]=f[i-2][j]+f[i-1][j];
        fib[i]=fib[i-2]+fib[i-1];if(fib[i]>inf){lst=i;break;}
    }
}
void cal(ll x,ll v){
    for(int i=lst;i>=1;i--)
        if(fib[i]<=x){
            x-=fib[i];
            for(int j=0;j<26;j++)ans[j]+=v*f[i][j];
        }
    for(int i=0;i<26;i++)ans[i]+=v*pre[x][i];
}
int main(){
    scanf("%s",s+1);l=read();r=read();
    n=strlen(s+1);n>>=1;
    for(int i=1;i<=n;i++){
        for(int j=0;j<26;j++)pre[i][j]+=pre[i-1][j];
        pre[i][s[i]-'a']++;
    }get_nxt();cutpos=n-nxt[n];
    get_fib();cal(r,1);cal(l-1,-1);
    for(int i=0;i<26;i++)write(ans[i]);puts("");
    return 0;
}
