#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	string s, t; cin >> s >> t;
	int sz = s.size(), tz = t.size();
	vector<int>a(n);
	rep(i, n) cin >> a[i];
	vector dp(200005, -INF);
	dp[0] = 0;
	rep(i, 200005) {
		{
			int ni = i + sz;
			if (ni < 200005)chmax(dp[ni], dp[i] + 1);
		}
		{
			int ni = i + tz;
			if (ni < 200005)chmax(dp[ni], dp[i] + 0);
		}
	}
	rep(i, n) {
		int x = dp[a[i]];
		int y = (a[i] - x * sz) / tz;
		rep(i, x)cout << s << " ";
		rep(i, y)cout << t << " ";
		cout << endl;
	}
	return 0;
}