#line 2 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"
using namespace std;

#include<bits/stdc++.h>
#line 1 "/Users/noya2/Desktop/Noya2_library/template/inout_old.hpp"
namespace noya2 {

template <typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p){
    os << p.first << " " << p.second;
    return os;
}
template <typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p){
    is >> p.first >> p.second;
    return is;
}

template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v){
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v){
    for (auto &x : v) is >> x;
    return is;
}

void in() {}
template <typename T, class... U>
void in(T &t, U &...u){
    cin >> t;
    in(u...);
}

void out() { cout << "\n"; }
template <typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u){
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}

template<typename T>
void out(const vector<vector<T>> &vv){
    int s = (int)vv.size();
    for (int i = 0; i < s; i++) out(vv[i]);
}

struct IoSetup {
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(15);
        cerr << fixed << setprecision(7);
    }
} iosetup_noya2;

} // namespace noya2
#line 1 "/Users/noya2/Desktop/Noya2_library/template/const.hpp"
namespace noya2{

const int iinf = 1'000'000'007;
const long long linf = 2'000'000'000'000'000'000LL;
const long long mod998 =  998244353;
const long long mod107 = 1000000007;
const long double pi = 3.14159265358979323;
const vector<int> dx = {0,1,0,-1,1,1,-1,-1};
const vector<int> dy = {1,0,-1,0,1,-1,-1,1};
const string ALP = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string alp = "abcdefghijklmnopqrstuvwxyz";
const string NUM = "0123456789";

void yes(){ cout << "Yes\n"; }
void no(){ cout << "No\n"; }
void YES(){ cout << "YES\n"; }
void NO(){ cout << "NO\n"; }
void yn(bool t){ t ? yes() : no(); }
void YN(bool t){ t ? YES() : NO(); }

} // namespace noya2
#line 2 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

#line 6 "/Users/noya2/Desktop/Noya2_library/template/utils.hpp"

namespace noya2{

unsigned long long inner_binary_gcd(unsigned long long a, unsigned long long b){
    if (a == 0 || b == 0) return a + b;
    int n = __builtin_ctzll(a); a >>= n;
    int m = __builtin_ctzll(b); b >>= m;
    while (a != b) {
        int mm = __builtin_ctzll(a - b);
        bool f = a > b;
        unsigned long long c = f ? a : b;
        b = f ? b : a;
        a = (c - b) >> mm;
    }
    return a << std::min(n, m);
}

template<typename T> T gcd_fast(T a, T b){ return static_cast<T>(inner_binary_gcd(std::abs(a),std::abs(b))); }

long long sqrt_fast(long long n) {
    if (n <= 0) return 0;
    long long x = sqrt(n);
    while ((x + 1) * (x + 1) <= n) x++;
    while (x * x > n) x--;
    return x;
}

template<typename T> T floor_div(const T n, const T d) {
    assert(d != 0);
    return n / d - static_cast<T>((n ^ d) < 0 && n % d != 0);
}

template<typename T> T ceil_div(const T n, const T d) {
    assert(d != 0);
    return n / d + static_cast<T>((n ^ d) >= 0 && n % d != 0);
}

template<typename T> void uniq(std::vector<T> &v){
    std::sort(v.begin(),v.end());
    v.erase(unique(v.begin(),v.end()),v.end());
}

template <typename T, typename U> inline bool chmin(T &x, U y) { return (y < x) ? (x = y, true) : false; }

template <typename T, typename U> inline bool chmax(T &x, U y) { return (x < y) ? (x = y, true) : false; }

template<typename T> inline bool range(T l, T x, T r){ return l <= x && x < r; }

} // namespace noya2
#line 8 "/Users/noya2/Desktop/Noya2_library/template/template.hpp"

#define rep(i,n) for (int i = 0; i < (int)(n); i++)
#define repp(i,m,n) for (int i = (m); i < (int)(n); i++)
#define reb(i,n) for (int i = (int)(n-1); i >= 0; i--)
#define all(v) (v).begin(),(v).end()

using ll = long long;
using ld = long double;
using uint = unsigned int;
using ull = unsigned long long;
using pii = pair<int,int>;
using pll = pair<ll,ll>;
using pil = pair<int,ll>;
using pli = pair<ll,int>;

namespace noya2{

/*　~ (. _________ . /)　*/

}

using namespace noya2;


#line 2 "c.cpp"

#line 2 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"

#line 5 "/Users/noya2/Desktop/Noya2_library/graph/grid.hpp"
#include <ranges>

namespace noya2 {

struct grid {
    int h, w;
    grid (int _h = 0, int _w = 0) : h(_h), w(_w) {}
    int idx(int x, int y) const {
        return x * w + y;
    }
    std::pair<int,int> pos(int id) const {
        return {id / w, id % w};
    }
    bool operator()(int x, int y) const {
        return 0 <= x && x < h && 0 <= y && y < w;
    }
    bool operator()(int id) const {
        return operator()(id / w, id % w);
    }
    static constexpr std::array<std::pair<int,int>, 4> dxys = {std::pair<int,int>{0, 1}, {-1, 0}, {0, -1}, {1, 0}};
    auto adj4(int x, int y) const {
        return dxys | std::views::transform([x, y](std::pair<int,int> dxy){
            return std::pair<int,int>(dxy.first + x, dxy.second + y);
        }) | std::views::filter([this](std::pair<int,int> xy){
            return operator()(xy.first, xy.second);
        });
    }
    auto adj4(int id) const {
        return adj4(id / w, id % w) | std::ranges::views::transform([this](std::pair<int,int> xy){
            return idx(xy.first, xy.second);
        });
    }
    int size() const {
        return h * w;
    }
};

} // namespace noya2
#line 4 "c.cpp"

void dump(auto ...vs){
    ((cerr << vs << ' '), ...) << endl;
}

void jikken1(){
    int n, m; in(n,m);
    grid gr(n,m);
    map<pii,int> st;
    queue<pii> que;
    que.emplace(1,0);
    st[pii(1,0)] = 0;
    while (!que.empty()){
        auto key = que.front(); que.pop();
        auto [s, xy] = key;
        auto [x, y] = gr.pos(xy);
        for (auto [nx, ny] : gr.adj4(x,y)){
            int nxy = gr.idx(nx,ny);
            int ns = s ^ (1 << nxy);
            pii nkey(ns,nxy);
            if (!st.contains(nkey)){
                st[nkey] = st[key] + 1;
                que.emplace(nkey);
            }
        }
    }
    map<int,int> ss;
    for (auto [spos, dist] : st){
        auto [s, pos] = spos;
        if (!ss.contains(s)){
            ss[s] = iinf;
        }
        chmin(ss[s],dist);
    }
    for (auto [s, dist] : ss){
        assert(dist <= 2*n*m-1);
        vector a(n,vector<int>(m));
        rep(i,n) rep(j,m){
            if (s >> gr.idx(i,j) & 1){
                a[i][j] = 1;
            }
        }
        out(a);
        out("dist=",dist);
        out();
    }
    out(ss.size());
}

vector<pii> calc(vector<vector<int>> b){
    int n = b.size(), m = b[0].size();
    // out("call",n,m); cout << flush;
    if (n * m <= 6){
        grid gr(n,m);
        map<pii,pii> pre;
        map<pii,int> dist;
        queue<pii> que;
        que.emplace(0,0);
        pre[pii(0,0)] = {-1,-1};
        dist[pii(0,0)] = 0;
        while (!que.empty()){
            auto key = que.front(); que.pop();
            auto [s, xy] = key;
            auto [x, y] = gr.pos(xy);
            for (auto [nx, ny] : gr.adj4(x,y)){
                int nxy = gr.idx(nx,ny);
                int ns = s ^ (1 << nxy);
                pii nkey(ns,nxy);
                if (!pre.contains(nkey)){
                    pre[nkey] = key;
                    dist[nkey] = dist[key] + 1;
                    que.emplace(nkey);
                }
            }
        }
        int tars = 0;
        rep(i,n) rep(j,m){
            if (b[i][j] == 1){
                tars ^= 1 << gr.idx(i,j);
            }
        }
        pii cur = [&]{
            int mi = iinf;
            pii ret(-1,-1);
            for (auto [spos, _] : pre){
                auto [s, pos] = spos;
                if (s == tars){
                    if (chmin(mi,dist[spos])){
                        ret = spos;
                    }
                }
            }
            assert(mi != iinf);
            return ret;
        }();
        vector<pii> ret;
        while (cur.first != -1){
            auto [s, pos] = cur;
            ret.emplace_back(gr.pos(pos));
            cur = pre[cur];
        }
        assert(!ret.empty());
        ret.pop_back();
        reverse(all(ret));
        return ret;
    }
    if (n < m){
        vector nb(m,vector<int>(n));
        rep(i,n) rep(j,m){
            nb[j][i] = b[i][j];
        }
        auto ret = calc(nb);
        for (auto &[x, y] : ret){
            swap(x,y);
        }
        return ret;
    }
    assert(m >= 2);
    vector<pii> ans;
    auto add = [&](int x, int y){
        ans.emplace_back(x,y);
        b[x][y] ^= 1;
    };
    auto reduce = [&](){
        rep(j,m){
            assert(b[0][j] == 0);
        }
        vector nb(n-1,vector<int>(m));
        rep(i,n-1) rep(j,m){
            nb[i][m-1-j] = b[i+1][j];
        }
        auto ret = calc(nb);
        for (auto [x, y] : ret){
            ans.emplace_back(x+1,m-1-y);
        }
        return ans;
    };
    if (m == 2){
        if (b[0][0] == 0){
            if (b[0][1] == 0){
                add(1,0);
                add(1,1);
                return reduce();
            }
            else {
                add(0,1);
                add(1,1);
                return reduce();
            }
        }
        else {
            if (b[0][1] == 0){
                add(0,1);
                add(0,0);
                add(0,1);
                add(1,1);
                return reduce();
            }
            else {
                add(0,1);
                add(0,0);
                add(1,0);
                add(1,1);
                return reduce();
            }
        }
    }
    assert(n >= 3);
    if ([&]{
        if (m % 2 == 0) return false;
        rep(j,m){
            if (b[0][j] != 1 - j % 2){
                return false;
            }
        }
        return true;
    }()){
        add(0,1);
        add(0,0);
        add(0,1);
        add(0,2);
        add(1,2);
        for (int y = 2; y <= m-3; y += 2){
            add(1,y+1);
            add(1,y+2);
            add(0,y+2);
            add(1,y+2);
        }
        return reduce();
    }
    add(1,0);
    for (int l = 0, r = 0; l < m; l = r){
        while (r < m && b[0][l] == b[0][r]) r++;
        if (b[0][l] == 0){
            for (int y = l+1; y < r; y++){
                add(1,y);
            }
            if (r != m){
                add(1,r);
            }
        }
        else {
            add(0,l);
            for (int y = l+1; y < r; y++){
                add(0,y);
            }
            add(1,r-1);
            if (r != m){
                add(1,r);
            }
        }
    }
    return reduce();
}

void solve(){
    // jikken1();
    int h, w; in(h,w);
    vector a(h,vector<ull>(w)); in(a);
    vector<pii> poss;
    vector<pair<ull,ull>> bs;
    rep(i,h) rep(j,w){
        ull cur = a[i][j], st = 0;
        for (auto [x, y] : bs){
            if (chmin(cur,cur^x)){
                st ^= y;
            }
        }
        if (cur != 0){
            int id = poss.size();
            poss.emplace_back(i,j);
            st ^= 1ULL << id;
            bs.emplace_back(cur, st);
        }
    }
    auto makeset = [&](ull tar) -> vector<vector<int>> {
        ull st = 0;
        for (auto [x, y] : bs){
            if (chmin(tar,tar^x)){
                st ^= y;
            }
        }
        if (tar != 0){
            return {};
        }
        vector b(h,vector<int>(w));
        for (int id = -1; auto [i, j] : poss){
            id++;
            if (st >> id & 1){
                b[i][j] = 1;
            }
        }
        return b;
    };
    int q; in(q);
    while (q--){
        ull tar; in(tar);
        auto b = makeset(tar);
        if (b.empty()){
            out(-1);
            continue;
        }
        // out(b);
        b[0][0] ^= 1;
        auto ans = calc(b);
        out(ans.size());
        assert(ssize(ans) <= 2*h*w-1);
        // dump(ans.size());
        ull jx = a[0][0];
        out(1,1);
        int px = 0, py = 0;
        for (auto [x, y] : ans){
            assert(grid(h,w)(x,y));
            assert(abs(px-x) + abs(py-y) == 1);
            out(x+1,y+1);
            jx ^= a[x][y];
            px = x, py = y;
        }
        // out(jx,tar); cout << flush;
        assert(jx == tar);
    }
}

int main(){
    int t = 1; //in(t);
    while (t--) { solve(); }
}