#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(a) (a).begin(), (a).end()
#define pb push_back
#define fi first
#define se second
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const ll MOD1000000007 = 1000000007;
const ll MOD998244353 = 998244353;
const ll MOD[3] = {999727999, 1070777777, 1000000007};
const ll LINF = 1LL << 60LL;
const int IINF = (1 << 30) - 2;


void solve(){
    // input
    int n; cin >> n;
    string s, t; cin >> s >> t;
    vector<int> a(n); for(int i=0; i<n; i++) cin >> a[i];

    int ssiz = (int)s.size(), tsiz = (int)t.size();
    for(int i=0; i<n; i++){
        for(int j=a[i]; j>=0; j--){
            if(j%ssiz==0){
                for(int k=0; k<j/ssiz; k++) cout << s << ' ';
                for(int k=0; k<(a[i]-j)/tsiz; k++) cout << t << ' ';
                cout << '\n';
                break;
            }
        }
    }
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    
    int T=1;
    //cin >> T;
    while(T--) solve();
}