#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include <cassert>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e18;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const double eps = 1E-18;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long x = 0) : x((x% MOD + MOD) % MOD) {}
	mint operator-() const {
		return mint(-x);
	}
	mint& operator+=(const mint& a) {
		if ((x += a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator-=(const mint& a) {
		if ((x += MOD - a.x) >= MOD) x -= MOD;
		return *this;
	}
	mint& operator*=(const  mint& a) {
		(x *= a.x) %= MOD;
		return *this;
	}
	mint operator+(const mint& a) const {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= a;
	}

	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime MOD
	mint inv() const {
		return pow(MOD - 2);
	}
	mint& operator/=(const mint& a) {
		return (*this) *= a.inv();
	}
	mint operator/(const mint& a) const {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

//////////////////////////////////////
vector<ll> z_algo(string S) {//0-index
	ll N = S.size();

	vector<ll> A(N, 0);


	ll c = 0;
	repn(i, N - 1) {
		if (c > 0 && i - c + A[i - c] < A[c]) { A[i] = A[i - c]; }
		else {
			ll j = max(0, c + A[c] - i);
			while (i + j < N && S[j] == S[i + j]) { j++; }
			A[i] = j;
			c = i;
		}
	}

	A[0] = N;

	return A;
}

ll pre(string S) {
	ll N = S.size();
	vll z = z_algo(S);
	//rep(j, N)cout << z[j] << " ";
	//cout << endl;

	repn(i, N) {
		bool b = 1;
		for (ll j = i; j < N; j+=i) {
			if (z[j] < min(N - j, i)) { b = 0; break; }
		}
		if (b) { return i; break; }
	}
}

string S;
ll N;
ll P;

map<ll, vll> mp;

vll f;

void cal(ll l) {
	//cout << l << endl;
	if (mp.count(l)) { return; }

	if (N % P == 0) {
		ll k = l / P;
		vll v = mp[P];
		rep(j, 26) { v[j] *= k; }
		rep(j, 26) {
			v[j] += mp[l % P][j];
		}
		mp[l] = v;

		
		return;
	}

	auto itr = lower_bound(f.begin(), f.end(), l);
	ll x = distance(f.begin(), itr) - 1;
	//cout << x<<" "<<f[x] << endl;
	
	cal(f[x]);
	cal(l - f[x]);

	vll ret(26, 0);
	rep(j, 26) {
		ret[j] = mp[f[x]][j] + mp[l - f[x]][j];
	}
	mp[l] = ret;
	return;
}

int main(){
	ll l, r;
	cin >> S >> l >> r;
	ll M = S.size();
	vll d = z_algo(S);
	N = M;
	repn(i, M - 1) {
		if (i * 2 >= M && d[i] >= M - i) { N = i; break; }
	}
	S = S.substr(0, N);
	//cout << S << endl;

	P = pre(S);
	//cout << N<<" "<<P << endl;
	
	vll c(26, 0);
	mp[0] = c;
	repn(i, N) {
		c[S[i - 1] - 'a']++;
		mp[i] = c;
	}

	f.assign(3, 0);
	f[0] = N;
	f[1] = N + P;
	f[2] = N * 2 + P;
	ll X = 3;
	while (1) {
		f.push_back(f[X - 1] - f[X - 3] + f[X - 1]);
		if (f[X] > INF || X > 500) { break; }
		//cout << f[X] << endl;
		X++;
	}

	cal(r);
	cal(l - 1);
	rep(j, 26) {
		cout << mp[r][j] - mp[l - 1][j] << " ";
	}
	cout << endl;
}



Measured memory_bytes: 34480