#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int n, m, ans;
vector<int> needs;
vector<vector<int>> foods;
vector<int> selected_foods;

void backtrack(int curr, vector<int> &selected, vector<int> remains) {
    if (selected.size() > ans) {
        return;
    }
    if (all_of(remains.begin(), remains.end(), [](int remain) { return remain <= 0; })) {
        if (selected.size() < ans) {
            ans = selected.size();
            selected_foods = selected;
        }
        return;
    }
    if (curr == m) {
        return;
    }

    vector<int> new_remains(n);
    for (int i = 0; i < n; ++i) {
        new_remains[i] = remains[i] - foods[curr][i];
    }
    selected.push_back(curr);
    backtrack(curr + 1, selected, new_remains);
    selected.pop_back();

    backtrack(curr + 1, selected, remains);
}

int main() {
    cin >> n;
    needs.resize(n);
    for (int i = 0; i < n; ++i) {
        cin >> needs[i];
    }

    cin >> m;
    foods.resize(m, vector<int>(n));
    for (int i = 0; i < m; ++i) {
        for (int j = 0; j < n; ++j) {
            cin >> foods[i][j];
        }
    }

    ans = m + 1;
    vector<int> selected;
    backtrack(0, selected, needs);

    cout << ans;
    for (int idx : selected_foods) {
        cout << " " << idx + 1;
    }
    cout << endl;

    return 0;
}