#include <bits/stdc++.h>
#include <atcoder/all>

using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
static const double pi = 3.141592653589793;
const ll INF = 1LL << 60;
const ll mod = 1000000007;
const ll imod = 998244353;
using mint = modint998244353;
vector<int> dx = {1, 0, -1, 0}, dy = {0, 1, 0, -1};
ll P(ll x, ll n) {
  ll ret = 1;
    while (n > 0) {
      if (n & 1) ret *= x;
      x *= x;
      n >>= 1;
  }
  return ret;
}

void seek(bool f){
  cout << (f ? "Yes" : "No") << endl;
}

int main(){
	int N;
	cin >> N;
	string S, T;
	cin >> S >> T;
	vector<int> C(N);
	rep(i, N){
		cin >> C[i];
	}
	int A = S.size(), B = T.size();
	rep(i, N){
		int t = 0;
		for(int y = 0; C[i] - B * y >= 0; y++){
			if((C[i] - B * y) % A == 0){
				t = y;
				break;
			}
		}
		for(int s = 1; A * s <= C[i] - B * t; s++){
			cout << S << " ";
		}
		rep(i, t){
			cout << T << " ";
		}
		cout << endl;
	}
}