#include <bits/stdc++.h>
#include <random>
#define ll long long int
#define pb push_back
#define st first
#define nd second
#define pii pair<int,int>
#define mp make_pair
#define pll pair<long long,long long>
#define ld long double
#define ull unsigned long long

using namespace std;

struct zap{
    pii from;
    pii to;
    int startTime;
    int id;
};

int n, m, q;
const int nax = 15005;
vector<vector<int> >  a;
vector<vector<int> > cycleLen;
vector<zap> all[840];

int ans[1000007];

bool sasCol[nax];
bool sasRow[nax];
int gora[842][nax];
int dol[842][nax];
int prawo[842][nax];
int lewo[842][nax];
bool goradol[842];

short int jmp[17][841][nax]; //[841][nax][17];

int pp[25];

void solve(){
    pp[0] = 1;
    for(int i=1;i<25;i++){
        pp[i] = pp[i - 1] * 2;
        pp[i] %= 840;
    }
    cin >> n >> m >> q;
    a.resize(n + 1);
    cycleLen.resize(n + 1);
    for(int i=0;i<=n;i++){
        a[i].resize(m + 1);
        cycleLen[i].resize(m + 1);
    }

    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            string s; cin >> s;
            cycleLen[i][j] = s.size();
            int v = 0;
            int w = 1;
            for(char x : s){
                v += w * (x - '0');
                w *= 2;
            }
            a[i][j] = v;
        }
    }
    for(int i=1;i<=q;i++){
        zap cur;
        cin >> cur.startTime;

        pii from, to;
        int a1,a2,a3,a4;
        cin >> a1 >> a2 >> a3 >> a4;

        cur.from = mp(a1, a2);
        cur.to = mp(a3, a4);
        cur.id = i;
        all[cur.startTime % 840].pb(cur);
    }
    
    for(int mod=0;mod<840;mod++){
        int w[9];
        for(int j=1;j<=8;j++) w[j] = mod % j;
        for(int i=0;i<nax;i++){
            sasCol[i] = false;
            sasRow[i] = false;
        }
        for(int i=1;i<=n;i++){
            for(int j=1;j<=m;j++){
                int v = (a[i][j] & (1 << w[cycleLen[i][j]]));
                sasRow[i - 1] |= (v == 0);
                sasCol[j - 1] |= (v != 0);
            }
        }
        bool colsUnited = true;
        bool rowsUnited = true;
        for(int i=0;i<n;i++){
            if(sasRow[i] == false) rowsUnited = false;
        }
        for(int i=0;i<m;i++){
            if(sasCol[i] == false) colsUnited = false;
        }
        if(colsUnited) goradol[mod] = true;
        // da sie przejsc wierszem z lewo na prawo xd, czyli mamy warstwy z gory do dolu
        gora[mod][0] = 0;
        for(int i=1;i<=n;i++){
            if(sasRow[i - 1]) gora[mod][i] = gora[mod][i - 1];
            else gora[mod][i] = i;
        }
        dol[mod][n] = n;
        for(int i=n-1;i>=0;i--){
            if(sasRow[i]) dol[mod][i] = dol[mod][i + 1];
            else dol[mod][i] = i;
        }

        lewo[mod][0] = 0;
        for(int i=1;i<=m;i++){
            if(sasCol[i - 1]) lewo[mod][i] = lewo[mod][i - 1];
            else lewo[mod][i] = i;
        }

        prawo[mod][m] = m;
        for(int i=m-1;i>=0;i--){
            if(sasCol[i]) prawo[mod][i] = prawo[mod][i + 1];
            else prawo[mod][i] = i;
        }
    }

    // jump pointery w PRAWO
    for(int mod=0;mod<840;mod++){
        for(int j=0;j<=m;j++){
            int go = prawo[mod][j];
            int nxt = mod + 1;
            if(nxt == 840) nxt -= 840;
            go = prawo[nxt][go];
            jmp[0][mod][j] = go;
        }
    }
    // mod J 17
    for(int lv=1;lv<17;lv++){
        for(int mod=0;mod<840;mod++){
            for(int j=0;j<=m;j++){
                int go = jmp[lv - 1][mod][j];
                int timer = (mod + pp[lv - 1]);
                if(timer >= 840) timer -= 840;
                go = jmp[lv - 1][timer][go];
                jmp[lv][mod][j] = go;
            }
        }
    }

    for(int mod=0;mod<840;mod++){
        for(auto cur : all[mod]){
            if(goradol[mod] == false && cur.from.nd <= cur.to.nd){
                int id = cur.id;
                // chcemy isc w prawo
                int start = cur.from.nd;
                int finish = cur.to.nd;
                if(prawo[mod][start] >= finish){
                    ans[id] = cur.startTime;
                    continue;
                }
                int cost = 0;
                int timer = mod;
                int pos = start;
                for(int i=16;i>=0;i--){
                    int go = jmp[i][timer][pos];
                    if(go < finish){
                        cost += (1 << i);
                        timer += pp[i];
                        if(timer >= 840) timer -= 840;
                        pos = go;
                    }
                }
                cost += 1;
                ans[id] = cur.startTime + cost;
            }
        }
    }


    //// LEWO

    // jump pointery w LEWO
    for(int mod=0;mod<840;mod++){
        for(int j=0;j<=m;j++){
            int go = lewo[mod][j];
            int nxt = mod + 1;
            if(nxt == 840) nxt -= 840;
            go = lewo[nxt][go];
            jmp[0][mod][j] = go;
        }
    }
    // mod J 17
    for(int lv=1;lv<17;lv++){
        for(int mod=0;mod<840;mod++){
            for(int j=0;j<=m;j++){
                int go = jmp[lv - 1][mod][j];
                int timer = (mod + pp[lv - 1]);
                if(timer >= 840) timer -= 840;
                go = jmp[lv - 1][timer][go];
                jmp[lv][mod][j] = go;
            }
        }
    }

    for(int mod=0;mod<840;mod++){
        for(auto cur : all[mod]){
            if(goradol[mod] == false && cur.from.nd > cur.to.nd){
                int id = cur.id;
                // chcemy isc w prawo
                int start = cur.from.nd;
                int finish = cur.to.nd;
                if(lewo[mod][start] <= finish){
                    ans[id] = cur.startTime;
                    continue;
                }
                int cost = 0;
                int timer = mod;
                int pos = start;
                for(int i=16;i>=0;i--){
                    int go = jmp[i][timer][pos];
                    if(go > finish){
                        cost += (1 << i);
                        timer += pp[i];
                        if(timer >= 840) timer -= 840;
                        pos = go;
                    }
                }
                cost += 1;
                ans[id] = cur.startTime + cost;
            }
        }
    }


    //////// DOL

    for(int mod=0;mod<840;mod++){
        for(int j=0;j<=n;j++){
            int go = dol[mod][j];
            int nxt = (mod + 1);
            if(nxt == 840) nxt -= 840;
            go = dol[nxt][go];
            jmp[0][mod][j] = go;
        }
    }
    // mod J 17
    for(int lv=1;lv<17;lv++){
        for(int mod=0;mod<840;mod++){
            for(int j=0;j<=n;j++){
                int go = jmp[lv-1][mod][j];
                int timer = (mod + pp[lv - 1]);
                if(timer >= 840) timer -= 840;
                go = jmp[lv-1][timer][go];
                jmp[lv][mod][j] = go;
            }
        }
    }

    for(int mod=0;mod<840;mod++){
        for(auto cur : all[mod]){
            if(goradol[mod] == true && cur.from.st <= cur.to.st){
                int id = cur.id;
                // chcemy isc w prawo
                int start = cur.from.st;
                int finish = cur.to.st;
                if(dol[mod][start] >= finish){
                    ans[id] = cur.startTime;
                    continue;
                }
                int cost = 0;
                int timer = mod;
                int pos = start;
                for(int i=16;i>=0;i--){
                    int go = jmp[i][timer][pos];
                    if(go < finish){
                        cost += (1 << i);
                        timer += pp[i];
                        if(timer >= 840) timer -= 840;
                        pos = go;
                    }
                }
                cost += 1;
                ans[id] = cur.startTime + cost;
            }
        }
    }


    ////////// GORA

    for(int mod=0;mod<840;mod++){
        for(int j=0;j<=n;j++){
            int go = gora[mod][j];
            int nxt = (mod + 1);
            if(nxt == 840) nxt -= 840;
            go = gora[nxt][go];
            jmp[0][mod][j] = go;
        }
    }
    // mod J 17
    for(int lv=1;lv<17;lv++){
        for(int mod=0;mod<840;mod++){
            for(int j=0;j<=n;j++){
                int go = jmp[lv-1][mod][j];
                int timer = (mod + pp[lv - 1]);
                if(timer >= 840) timer -= 840;
                go = jmp[lv-1][timer][go];
                jmp[lv][mod][j] = go;
            }
        }
    }

    for(int mod=0;mod<840;mod++){
        for(auto cur : all[mod]){
            if(goradol[mod] == true && cur.from.st >= cur.to.st){
                int id = cur.id;
                // chcemy isc w prawo
                int start = cur.from.st;
                int finish = cur.to.st;
                if(gora[mod][start] <= finish){
                    ans[id] = cur.startTime;
                    continue;
                }
                int cost = 0;
                int timer = mod;
                int pos = start;
                for(int i=16;i>=0;i--){
                    int go = jmp[i][timer][pos];
                    if(go > finish){
                        cost += (1 << i);
                        timer += pp[i];
                        if(timer >= 840) timer -= 840;
                        pos = go;
                    }
                }
                cost += 1;
                ans[id] = cur.startTime + cost;
            }
        }
    }
   
    for(int i=1;i<=q;i++) cout << ans[i] << "\n";

}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    int tt = 1;
    // cin >> tt;
    while(tt--) solve();

    return 0;
}