#include <iostream>
#include <vector>
#include <cstdio>
#include <sstream>
#include <map>
#include <string>
#include <algorithm>
#include <queue>
#include <cmath>
#include <functional>
#include <set>
#include <ctime>
#include <random>
#include <chrono>
#include <cassert>
#include <tuple>
#include <utility>
using namespace std;

namespace {
  using Integer = long long; //__int128;
  template<class T, class S> istream& operator >> (istream& is, pair<T,S>& p){return is >> p.first >> p.second;}
  template<class T> istream& operator >> (istream& is, vector<T>& vec){for(T& val: vec) is >> val; return is;}
  template<class T> istream& operator ,  (istream& is, T& val){ return is >> val;}
  template<class T, class S> ostream& operator << (ostream& os, const pair<T,S>& p){return os << p.first << " " << p.second;}
  template<class T> ostream& operator << (ostream& os, const vector<T>& vec){for(size_t i=0; i<vec.size(); i++) os << vec[i] << (i==vec.size()-1?"":" "); return os;}
  template<class T> ostream& operator ,  (ostream& os, const T& val){ return os << " " << val;}

  template<class H> void print(const H& head){ cout << head; }
  template<class H, class ... T> void print(const H& head, const T& ... tail){ cout << head << " "; print(tail...); }
  template<class ... T> void println(const T& ... values){ print(values...); cout << endl; }

  template<class H> void eprint(const H& head){ cerr << head; }
  template<class H, class ... T> void eprint(const H& head, const T& ... tail){ cerr << head << " "; eprint(tail...); }
  template<class ... T> void eprintln(const T& ... values){ eprint(values...); cerr << endl; }

  class range{ Integer start_, end_, step_; public: struct range_iterator{ Integer val, step_; range_iterator(Integer v, Integer step) : val(v), step_(step) {} Integer operator * (){return val;} void operator ++ (){val += step_;} bool operator != (range_iterator& x){return step_ > 0 ? val < x.val : val > x.val;} }; range(Integer len) : start_(0), end_(len), step_(1) {} range(Integer start, Integer end) : start_(start), end_(end), step_(1) {} range(Integer start, Integer end, Integer step) : start_(start), end_(end), step_(step) {} range_iterator begin(){ return range_iterator(start_, step_); } range_iterator   end(){ return range_iterator(  end_, step_); } };

  inline string operator "" _s (const char* str, size_t size){ return move(string(str)); }
  constexpr Integer my_pow(Integer x, Integer k, Integer z=1){return k==0 ? z : k==1 ? z*x : (k&1) ? my_pow(x*x,k>>1,z*x) : my_pow(x*x,k>>1,z);}
  constexpr Integer my_pow_mod(Integer x, Integer k, Integer M, Integer z=1){return k==0 ? z%M : k==1 ? z*x%M : (k&1) ? my_pow_mod(x*x%M,k>>1,M,z*x%M) : my_pow_mod(x*x%M,k>>1,M,z);}
  constexpr unsigned long long operator "" _ten (unsigned long long value){ return my_pow(10,value); }

  inline int k_bit(Integer x, int k){return (x>>k)&1;} //0-indexed

  mt19937 mt(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count());

  template<class T> string join(const vector<T>& v, const string& sep){ stringstream ss; for(size_t i=0; i<v.size(); i++){ if(i>0) ss << sep; ss << v[i]; } return ss.str(); }

  inline string operator * (string s, int k){ string ret; while(k){ if(k&1) ret += s; s += s; k >>= 1; } return ret; }
}
constexpr long long mod = 9_ten + 7;

vector<int> z_algorithm(const string& s){
  int n = s.size();
  vector<int> z(n, 0);
  int l = 0;
  for(int i=1; i<n; i++){
    if( i+z[i-l] < l+z[l] ){
      z[i] = z[i-l];
    }else{
      int j = max(0, l+z[l]-i);
      while( i+j < n && s[j] == s[i+j] ) j++;
      z[i] = j;
      l = i;
    }
  }
  return z;
}

vector<long long> sums[26];

map<tuple<int,long long,long long>, vector<long long>> memo;

// [l,r)
vector<long long> rec(string& s, vector<long long>& len, long long l, long long r, int d){
  auto state = make_tuple(d,l,r);
  if(memo.count(state)){
    return memo[state];
  }

  if(d == 0){
    vector<long long> cnt(26);
    for(int i=0; i<26; i++){
      cnt[i] += sums[i][r] - sums[i][l];
    }
    return memo[state] = cnt;
  }

  if( r <= len[d-1] ){
    return memo[state] = rec(s,len, l, r, d-1);
  }
  if( len[d-1] <= l ){
    return memo[state] = rec(s,len, l-len[d-1], r-len[d-1], max(0,d-2));
  }
  auto x = rec(s,len,l,len[d-1], d-1);
  auto y = rec(s,len,0,r-len[d-1], max(0,d-2));
  for(int i=0; i<26; i++){
    x[i] += y[i];
  }
  return memo[state] = x;
}

int main(){
  string s;
  cin >> s;
  long long l,r;
  cin >> l,r;

  auto z = z_algorithm(s);
  // eprintln(z);
  int left = (s.size()+2)/2+1;
  while(left<s.size() && z[left]<s.size()-left){
    left++;
  }
  s = s.substr(0,left);
  z = z_algorithm(s);
  left = 1;
  while(left<s.size() && z[left]<s.size()-left){
    left++;
  }
  long long border = s.size() - left;
  long long period = s.size() - border;

  for(int i=0; i<26; i++){
    sums[i].resize(s.size()+1);
  }
  for(int i=0; i<s.size(); i++){
    sums[ s[i]-'a' ][i+1]++;
  }
  for(int i=0; i<26; i++){
    for(int j=1; j<=s.size(); j++){
      sums[i][j] += sums[i][j-1];
    }
  }

  if( s.size() % period == 0 ){
    l--;
    long long x = r/period;
    long long y = l/period;
    vector<long long> ans(26);
    for(int i=0; i<26; i++){
      ans[i] += sums[i][period] * (x-y);
      ans[i] += sums[i][r%period];
      ans[i] -= sums[i][l%period];
    }

    println(join(ans, " "));
    return 0;
  }

  vector<long long> len;
  len.push_back( s.size() );

  while(true){
    len.push_back( len.back() + period );
    period = len.back() - period;
    if(len.back() >= r) break;
  }

  auto ans = rec(s, len, l-1,r, len.size()-1);
  println(join(ans, " "));

  return 0;
}


Measured memory_bytes: 42032