// #define _GLIBCXX_DEBUG // (提出時はコメントアウトする) #include #define rep(i, a, n) for (int i = a; i < (int)(n); i++) #define all(a) begin(a), end(a) #define rall(a) rbegin(a), rend(a) #define vi vector #define vs vector #define vvi vector> #define vb vector #define ll long long #define dd double using namespace std; void faster() { ios::sync_with_stdio(false); cin.tie(0); } template void input(T &x) { cin >> x; } template void input(T &x, Args &...args) { cin >> x; input(args...); } template void sorts(vector &vec) { sort(vec.begin(), vec.end()); } template void rsorts(vector &vec) { sort(vec.begin(), vec.end(), greater()); } template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } struct timekeeper { chrono::high_resolution_clock::time_point starttime; chrono::high_resolution_clock::time_point endtime; chrono::duration duration; }; ll sum_1_to_n(const ll &a) { return a * (a + 1) / 2; } ll rounding(ll target, ll keta) { ll now = 1; rep(i, 0, keta) { target /= now; int k = target % 10; if (k >= 5) { target += 10 - k; } else { target -= k; } target *= now; now *= 10; } return target; } unsigned ll ceiling(const unsigned ll &a, const unsigned ll &b) // a/b切り上げ { return (a + b - 1) / b; } // 上、下、右、左、右上、右下、左上、左下 vi xmove = {0, 0, 1, -1, 1, 1, -1, -1}; vi ymove = {-1, 1, 0, 0, -1, 1, -1, 1}; int main() { int n; cin >> n; string s, t; cin >> s >> t; int ss = s.size(), tt = t.size(); rep(i, 0, n) { int k; cin >> k; if (k % ss == 0) { rep(i, 0, k / ss) { cout << s << " "; } cout << endl; continue; } else { int sss = k / ss; int rm = k % ss; int ttt = -1; while (true) { if (rm % tt == 0) { ttt = rm / tt; break; } rm += ss; sss--; } rep(__, 0, sss) { cout << s << " "; } rep(_, 0, ttt) { cout << t << " "; } cout << endl; } } }