/** author: shobonvip created: 2024.10.25 21:24:58 **/ #include using namespace std; //* ATCODER #include using namespace atcoder; typedef modint998244353 mint; //*/ /* BOOST MULTIPRECISION #include using namespace boost::multiprecision; //*/ typedef long long ll; #define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++) #define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--) template bool chmin(T &a, const T &b) { if (a <= b) return false; a = b; return true; } template bool chmax(T &a, const T &b) { if (a >= b) return false; a = b; return true; } template T max(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]); return ret; } template T min(vector &a){ assert(!a.empty()); T ret = a[0]; for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]); return ret; } template T sum(vector &a){ T ret = 0; for (int i=0; i<(int)a.size(); i++) ret += a[i]; return ret; } int main(){ ios_base::sync_with_stdio(false); cin.tie(NULL); int n; cin >> n; string s; cin >> s; string t; cin >> t; int p = s.size(); int q = t.size(); rep(i,0,n){ int a; cin >> a; int ansx = -1, ansy = -1; rep(x,0,a+1){ if(x*p>a)break; int amari = a-x*p; if(amari%q!=0) continue; int y = amari/q; ansx = x; ansy = y; } rep(j,0,ansx) cout << s << ' '; rep(j,0,ansy) cout << t << ' '; cout << '\n'; } }