#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <sstream>
#include <complex>
#include <ctime>
#include <cassert>
#include <functional>

using namespace std;

typedef long long ll;
typedef vector<int> VI;
typedef pair<int,int> PII;

#define REP(i,s,t) for(int i=(s);i<(t);i++)
#define FILL(x,v) memset(x,v,sizeof(x))

const ll INF = (ll)1E18+1;
#define MAXN 200005

char pattern[MAXN];
int nxt[MAXN];
void calcNext(){
  int k=0, len = strlen(pattern);
  nxt[0] = 0;
  for(int i=1; i<=len; i++){
    if(pattern[i]==pattern[k]) nxt[i] = nxt[k++];
    else{
      nxt[i] = k;
      while(k>0 && pattern[i]!=pattern[k]) k=nxt[k];
      if(pattern[k]==pattern[i]) k++;
    }
  }
}

ll plen[100], cnt[100][26];
int N, Tlen, stcnt[MAXN][26];
vector<ll> solve(int i, ll k) {
  vector<ll> sol(26,0), sol2(26,0);
  if (k == 0) return sol;
  if (i <= 1) {
    REP(c,0,26) sol[c] = stcnt[k-1][c];
    return sol;
  }
  if (k <= plen[i-1]) {
    sol = solve(i-1, k);
  } else {
    REP(c,0,26) sol[c] = cnt[i-1][c];
    sol2 = solve(i-2, k-plen[i-1]);
    REP(c,0,26) sol[c] += sol2[c];
  }
  return sol;
}
int main() {
  ll L, R;
  cin >> pattern >> L >> R;
  N = strlen(pattern);
  N /= 2;
  pattern[N] = 0;
  calcNext();
  Tlen = N - nxt[N];
  REP(i,N,N+Tlen) pattern[i] = pattern[i-N];
  REP(i,0,N+Tlen) {
    if (i) REP(c,0,26) stcnt[i][c] = stcnt[i-1][c];
    stcnt[i][pattern[i]-'a']++;
  }
  plen[0] = N;
  plen[1] = N + Tlen;
  REP(c,0,26) {
    cnt[0][c] = stcnt[plen[0]-1][c];
    cnt[1][c] = stcnt[plen[1]-1][c];
  }
  int maxi = 1;
  REP(i,2,100) {
    plen[i] = plen[i-1] + plen[i-2];
    REP(c,0,26) cnt[i][c] = cnt[i-1][c] + cnt[i-2][c];
    if (plen[i] >= INF) {
      maxi = i;
      break;
    }
  }
  vector<ll> ans = solve(maxi, R);
  vector<ll> dec = solve(maxi, L-1);
  REP(c,0,26) cout << ans[c] - dec[c] << " ";
  return 0;
}
