#include <bits/stdc++.h>

using namespace std;
#define FOR(i,n) for(int i = 0; i < (n); i++)
#define sz(c) ((int)c.size())
#define ten(n) ((int)1e##n)
using ll = long long;
using Pii = pair<int, int>;
using Pll = pair<ll, ll>;

template<typename ...> static inline int getchar_unlocked(void) { return getchar(); }
template<typename ...> static inline void putchar_unlocked(int c) { putchar(c); }
#define mygc(c) (c)=getchar_unlocked()
#define mypc(c) putchar_unlocked(c)
void reader(int& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
void reader(ll& x) { int k, m = 0; x = 0; for (;;) { mygc(k); if (k == '-') { m = 1; break; }if ('0' <= k&&k <= '9') { x = k - '0'; break; } }for (;;) { mygc(k); if (k<'0' || k>'9')break; x = x * 10 + k - '0'; }if (m) x = -x; }
int reader(char c[]) { int i, s = 0; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c[s++] = i; for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c[s++] = i; }c[s] = '\0'; return s; }
int reader(string& c) { int i; for (;;) { mygc(i); if (i != ' '&&i != '\n'&&i != '\r'&&i != '\t'&&i != EOF) break; }c.push_back(i); for (;;) { mygc(i); if (i == ' ' || i == '\n' || i == '\r' || i == '\t' || i == EOF) break; c.push_back(i); }; return sz(c); }
template <class T, class S> void reader(T& x, S& y) { reader(x); reader(y); }
template <class T, class S, class U> void reader(T& x, S& y, U& z) { reader(x); reader(y); reader(z); }
template <class T, class S, class U, class V> void reader(T& x, S& y, U& z, V & w) { reader(x); reader(y); reader(z); reader(w); }
void writer(int x, char c) { int s = 0, m = 0; char f[10]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(ll x, char c) { int s = 0, m = 0; char f[20]; if (x<0)m = 1, x = -x; while (x)f[s++] = x % 10, x /= 10; if (!s)f[s++] = 0; if (m)mypc('-'); while (s--)mypc(f[s] + '0'); mypc(c); }
void writer(const char c[]) { int i; for (i = 0; c[i] != '\0'; i++)mypc(c[i]); }
void writer(const string& x, char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
void writer(const char x[], char c) { int i; for (i = 0; x[i] != '\0'; i++)mypc(x[i]); mypc(c); }
template<class T> void writerLn(T x) { writer(x, '\n'); }
template<class T, class S> void writerLn(T x, S y) { writer(x, ' '); writer(y, '\n'); }
template<class T, class S, class U> void writerLn(T x, S y, U z) { writer(x, ' '); writer(y, ' '); writer(z, '\n'); }
template<class T> void writerArr(T x[], int n) { if (!n) { mypc('\n'); return; }FOR(i, n - 1)writer(x[i], ' '); writer(x[n - 1], '\n'); }
template<class T> void writerArr(vector<T>& x) { writerArr(x.data(), (int)x.size()); }

template<class T> void chmin(T& a, const T& b) { if (a > b) a = b; }
template<class T> void chmax(T& a, const T& b) { if (a < b) a = b; }

template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
ll mod_pow(ll a, ll n, ll mod) {
	ll ret = 1;
	ll p = a % mod;
	while (n) {
		if (n & 1) ret = ret * p % mod;
		p = p * p % mod;
		n >>= 1;
	}
	return ret;
}
template<class T> T extgcd(T a, T b, T& x, T& y) { for (T u = y = 1, v = x = 0; a;) { T q = b / a; swap(x -= q * u, u); swap(y -= q * v, v); swap(b -= q * a, a); } return b; }
template<class T> T mod_inv(T a, T m) { T x, y; extgcd(a, m, x, y); return (m + x % m) % m; }

vector<int> z_algo(const string& S) {
	vector<int> A(sz(S));
	A[0] = S.size();
	int i = 1, j = 0;
	while (i < S.size()) {
		while (i + j < S.size() && S[j] == S[i + j]) ++j;
		A[i] = j;
		if (j == 0) { ++i; continue; }
		int k = 1;
		while (i + k < S.size() && k + A[k] < j) A[i + k] = A[k], ++k;
		i += k; j -= k;
	}

	return A;
}

ll cnt[2 * ten(5) + 10];

void solve(ll a0, ll a1, ll r, vector<ll>& ret) {
	vector<ll> fib = { a0, a1 };
	while (fib.back() < r) {
		ll nxt = fib[sz(fib) - 1] + fib[sz(fib) - 2];
		fib.push_back(nxt);
	}

	map<ll, ll> mp;
	mp[r]++;
	while (true) {
		ll idx, cnt; tie(idx, cnt) = *mp.rbegin();
		if (idx <= a0) break;
		mp.erase(prev(mp.end()));

		int fib_i = lower_bound(fib.begin(), fib.end(), idx) - fib.begin();
		fib_i--;

		mp[fib[fib_i]] += cnt;
		mp[idx - fib[fib_i]] += cnt;
	}

	ret.resize((int)a0 + 1);
	for (auto kv : mp) {
		ret[(int)kv.first] += kv.second;
	}
	for (int i = a0; i > 0; i--) ret[i - 1] += ret[i];
}

int main() {
	string s; reader(s);
	string o = s;
	vector<int> len;
	FOR(i,4) {
		len.push_back(sz(s) / 2);
		//printf("%d : ", sz(s) / 2);
		//cout << s.substr(sz(s) / 2) << endl;

		auto len = z_algo(s);
		for (int j = sz(s) / 2 + 1; j <= sz(s); j++) {
			bool ok = true;
			if (j != sz(s)) {
				if (len[j] + j != sz(s)) {
					ok = false;
				}
			}
			if (ok) {
				string t;
				t = s.substr(0, j);
				t = t + t;
				s = t;
				break;
			}
		}
	}

	ll l, r; reader(l, r);
	l--;
	if (len[2] == len[1] + len[0] && len[3] == len[2] + len[1]) {
		vector<ll> ret1;
		solve(len[0], len[1], r, ret1);
		vector<ll> ret2;
		solve(len[0], len[1], l, ret2);

		FOR(i, sz(ret1) - 1) {
			cnt[i] = ret1[i + 1] - ret2[i + 1];
		}
	} else {
		int diff = len[1] - len[0];
		FOR(i, sz(o)) {
			cnt[i] += r / sz(o);
			if (i < r % sz(o)) cnt[i]++;
			cnt[i] -= l / sz(o);
			if (i < l % sz(o)) cnt[i]--;
		}
	}

	vector<ll> ans(26);
	FOR(i, sz(o)) {
		ans[o[i] - 'a'] += cnt[i];
	}
	writerArr(ans);


	return 0;
}


Measured memory_bytes: 8292