First

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

int main() {
    int m, n, k;
    cin >> m >> n >> k;
    vector<int> a;
    for (int i = 0; i < m; ++i) {
        cin >> a[i];
    }
    vector<vector<int>> v;
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < k; ++j) {
            cin >> v[i][j];
        }
    }
    reverse(begin(v), end(v));
    int curr_flat = 0;
    int c = 0;
    int lit = 0;
    vector<int> flat_indices;
    for (int i = 0; i < n; ++i) {
        for (size_t j = 0; j < a.size(); ++j) {
            for (size_t b = 0; b < a[j]; ++b, lit += v[i][b]);
        }
        if (lit == 0)
            flat_indices.push_back(m * i + curr_flat + 1);
    }
    cout << flat_indices.size() << "\n";
    for (int i = 0; i < flat_indices.size(); ++i) {
        cout << flat_indices[i] << " ";
    }
    return 0;
    /*for (int j = 0; j < k; ++j, ++c, lit += v[i][j]) {
        if (k == a[curr_flat]) {
            curr_flat++;
            c = 0;
            if (lit == 0)
                flat_indices.push_back();
        }
    }*/
}