#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
#ifdef Doludu
template <typename T>
ostream& operator << (ostream &o, vector <T> vec) {
    o << "{"; int f = 0;
    for (T i : vec) o << (f++ ? " " : "") << i;
    return o << "}";
}
void bug__(int c, auto ...a) {
    cerr << "\e[1;" << c << "m";
    (..., (cerr << a << " "));
    cerr << "\e[0m" << endl;
}
#define bug_(c, x...) bug__(c, __LINE__, "[" + string(#x) + "]", x)
#define bug(x...) bug_(32, x)
#define bugv(x...) bug_(36, vector(x))
#define safe bug_(33, "safe")
#else
#define bug(x...) void(0)
#define bugv(x...) void(0)
#define safe void(0)
#endif
const int mod = 998244353, N = 300005;

void solve() {
    int n, m;
    cin >> n >> m;
    vector <ll> basis(60);
    vector pos(60, vector(n * m, 0));
    for (int i = 0; i < n; ++i) {
        for (int j = 0; j < m; ++j) {
            ll x;
            cin >> x;
            vector <int> cur(n * m, 0);
            cur[i * m + j] = 1;
            for (int k = 59; ~k; --k) if (x >> k & 1) {
                if (!basis[k]) {
                    basis[k] = x;
                    pos[k] = cur;
                    break;
                }
                x ^= basis[k];
                for (int ii = 0; ii < n * m; ++ii) {
                    cur[ii] ^= pos[k][ii];
                }
            }
        }
    }
    int q;
    cin >> q;
    while (q--) {
        ll x;
        cin >> x;
        vector goal(n, vector(m, 0));
        for (int k = 59; ~k; --k) if (x >> k & 1) {
            for (int i = 0; i < n * m; ++i) {
                goal[i / m][i % m] ^= pos[k][i];
            }
            x ^= basis[k];
        }
        if (x != 0) {
            cout << "-1\n";
            continue;
        }
        vector <pii> ans;
        auto push = [&](int i, int j) {
            ans.emplace_back(i, j);
            goal[i][j] ^= 1;
        };
        push(0, 0);
        for (int i = 0; i < n; ++i) {
            vector <int> vec;
            for (int j = 1; j < m; ++j) if (goal[i][j]) {
                vec.pb(j);
            }
            if (!vec.empty()) {
                for (int j : vec) {
                    push(i, j);
                }
                push(i, 0);
            }
            if (i + 1 < n) push(i + 1, 0);
        }
        vector <int> vec;
        for (int i = 0; i < n; ++i) if (goal[i][0]) {
            vec.pb(i);
        }
        if (sz(vec) == 1 && vec[0] == n - 1) {
            push(n - 2, 0);
            push(n - 1, 0);
            push(n - 2, 0);
        } else {
            for (int i : vec) {
                push(i, 0);
            }
        }
        cout << sz(ans) - 1 << "\n";
        for (auto [i, j] : ans) {
            cout << ++i << " " << ++j << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(0);
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }
}