#pragma comment(linker, "/STACK:102400000, 102400000")

#include<cstdio>

#include<cstring>

#include<cstdlib>

#include<cctype>

#include<cmath>

#include<iostream>

#include<sstream>

#include<iterator>

#include<algorithm>

#include<string>

#include<vector>

#include<set>

#include<map>

#include<stack>

#include<deque>

#include<queue>

#include<list>

#define Min(a, b) ((a < b) ? a : b)

#define Max(a, b) ((a < b) ? b : a)

typedef long long ll;

typedef unsigned long long llu;

const int INT_INF = 0x3f3f3f3f;

const int INT_M_INF = 0x7f7f7f7f;

const ll LL_INF = 0x3f3f3f3f3f3f3f3f;

const ll LL_M_INF = 0x7f7f7f7f7f7f7f7f;

const int dr[] = {, , -, , -, -, , };

const int dc[] = {-, , , , -, , -, };

const int MOD = 1e4;

const double pi = acos(-1.0);

const double eps = 1e-;

const int MAXN =  + ;

const int MAXT =  + ;

using namespace std;

struct Matrix{

    int ma[][];

    Matrix(){

        ma[][] = ma[][] = ;

        ma[][] = ma[][] = ;

    }

}num[MAXN << ];

int r;

Matrix mul(Matrix a, Matrix b){

    Matrix ans;

    for(int i = ; i < ; ++i){

        for(int j = ; j < ; ++j){

            ans.ma[i][j] = ;

            for(int k = ; k < ; ++k){

                (ans.ma[i][j] += (a.ma[i][k] * b.ma[k][j]) % r) %= r;

            }

        }

    }

    return ans;

}

void add_up(int id){

    num[id] = mul(num[id << ], num[id <<  | ]);

}

void add(int l, int r, int cur, Matrix x, int id){

    if(l == r){

        num[id] = x;

        return;

    }

    int mid = (l + r) >> ;

    if(cur <= mid){

        add(l, mid, cur, x, id << );

    }

    else add(mid + , r, cur, x, id <<  | );

    add_up(id);

}

Matrix query(int L, int R, int l, int r, int id){

    if(l >= L && r <= R){

        return num[id];

    }

    int mid = (l + r) >> ;

    Matrix ans;

    if(L <= mid){

        ans = mul(ans, query(L, R, l, mid, id << ));

    }

    if(R >= mid + ){

        ans = mul(ans, query(L, R, mid + , r, id <<  | ));

    }

    return ans;

}

int main(){

    int n, m;

    bool flag = true;

    while(scanf("%d%d%d", &r, &n, &m) == ){

        if(flag) flag = false;

        else printf("\n");

        for(int i = ; i <= n; ++i){

            Matrix tmp;

            for(int j = ; j < ; ++j){

                for(int k = ; k < ; ++k){

                    scanf("%d", &tmp.ma[j][k]);

                }

            }

            add(, n, i, tmp, );

        }

        while(m--){

            int x, y;

            scanf("%d%d", &x, &y);

            Matrix t = query(x, y, , n, );

            printf("%d %d\n", t.ma[][], t.ma[][]);

            printf("%d %d\n", t.ma[][], t.ma[][]);

            if(m) printf("\n");

        }

    }

    return ;

}