#include <bits/stdc++.h>

using namespace std;
const int INF = 1e9;

int main() {
    int n;
    cin >> n;
    vector<int> a(n);
    for (auto& i : a) cin >> i;
    int k;
    cin >> k;
    vector<int> dp(n + 1);
    dp[0] = 0;
    for (int m = 1; m <= n; ++m) {
        dp[m] = INF;
        for (int i = 0; i < k; ++i) {
            if (m >= a[i] && dp[m - a[i]] + 1 < dp[m]) {
                dp[m] = dp[m - a[i]] + 1;
            }
        }
    }
    if (dp[n] == INF) {
        cout << -1;
    } else {
        while (n > 0) {
            for (int i = 0; i < k; ++i) {
                if (dp[n - a[i]] == dp[n] - 1) {
                    cout << a[i] << " ";
                    n -= a[i];
                    break;
                }
            }
        }
    }
}