#include <bits/stdc++.h>
#define ll long long
#define pb push_back

using namespace std;

char query1(ll i, ll n, string &a, vector<string> &str)
{
    if(str[0].size() != 0 && i <= n * str[0].size())
    {
        i--;
        i %= str[0].size();
        i++;

        return str[0][i - 1];
    }

    i -= n * str[0].size();

    if(i <= n * a.size())
    {
        i--;
        i %= a.size();
        i++;

        return a[i - 1];
    }

    i -= n * a.size();

    i--;
    i %= str[1].size();
    i++;

    return str[1][i - 1];
}

char query(ll i, ll n, string &a, vector<string> &str, vector<ll> &len, int &cnt)
{
    if(cnt == 1) return query1(i, n, a, str);

    if(n == 0)
    {
        if(i <= a.size()) return a[i - 1];
        else return '?';
    }

    if(n > len.size())
    {
        if(str[0].size() != 0 && i <= (n - len.size()) * str[0].size())
        {
            i--;
            i %= str[0].size();
            i++;

            return str[0][i - 1];
        }

        i -= (n - len.size()) * str[0].size();

        return query(i, len.size(), a, str, len, cnt);
    }

    for(int j = 0; j < str.size(); j++)
    {
        if(i <= str[j].size()) return str[j][i - 1];
        i -= str[j].size();


        if(i <= len[n - 1]) return query(i, n - 1, a, str, len, cnt);
        else i -= len[n - 1];
    }

    return '?';
}

int main()
{
    ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);

	string a, s;
	cin >> a >> s;

    int n, q;
    cin >> n >> q;

    int cnt = 0;
    for(char c: s) if(c == '$') cnt++;

    vector<string> str;
    string now;
    for(char c: s)
    {
        if(c == '$')
        {
            str.pb(now);
            now = "";
            continue;
        }

        now += c;
    }
    str.pb(now);

    /*for(string x: str) cout << x << " ";
    cout << "\n";

    for(string x: str) cout << x.size() << " ";
    cout << "\n";*/

    ll l = a.size();
    vector<ll> len;
    for(int i=0; i<n; i++)
    {
        len.pb(l);

        if(l - 1 > ((1LL<<60) / cnt)) break;
        l = (l - 1) * cnt + s.size();
    }

    /*for(ll l: len) cout << l << " ";
    cout << "\n";*/

    while(q-->0)
    {
        ll l, r;
        cin >> l >> r;

        for(ll i=l; i<=r; i++) cout << query(i, n, a, str, len, cnt);
        cout << "\n";
    }
}