#include <bits/stdc++.h>
using namespace std;
ifstream f("struti.in");
ofstream g("struti.out");
const int Max = 1e3 + 1;
void nos()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
}
struct minim
{
    bool operator () (int a, int b) const
    {
        return a < b;
    }
};
struct maxim
{
    bool operator () (int a, int b) const
    {
        return a > b;
    }
};
int n,m,q;
int a[Max][Max];
int rmaxq[Max][Max][15];
int rminq[Max][Max][15];

void read()
{
    f>>n>>m>>q;
    int i,j;
    for(i=0; i<n; i++)
        for(j=0; j<m; j++)
            f>>a[i][j];
}
int cnt;
int min_delta;

int go_on_row(int start_poz, int dimx, int dimy)
{
    multiset < int, minim > lowest;
    multiset < int, maxim > highest;
    deque < int > elemente;
    int i,j;
    for(j=1; j<=dimy +1; ++j)
        for(i=start_poz ; i <= start_poz + dimx; i++)
        {
            elemente.push_back(a[i][j]);
            lowest.insert(a[i][j]);
            highest.insert(a[i][j]);
        }
    for(j=dimy + 2; j<= m; ++j)
    {
        int current_delta = *highest.begin() - *lowest.begin();        \
        if(current_delta == min_delta)
            ++cnt;
        if(current_delta < min_delta)
        {
            min_delta = current_delta;
            cnt = 1;
        }
        for(i=start_poz; i<=start_poz + dimx; i++)
        {
            int frnt = elemente.front();
            auto delmin = lowest.find(frnt);
            lowest.erase(delmin);
            auto delmax = highest.find(frnt);
            highest.erase(delmax);
            elemente.pop_front();
            elemente.push_back(a[i][j]);
            lowest.insert(a[i][j]);
            highest.insert(a[i][j]);
        }
    }
    int current_delta = *highest.begin() - *lowest.begin();
    if(current_delta < min_delta)
    {
        min_delta = current_delta;
        cnt = 1;
    }
    if(current_delta == min_delta)
        ++cnt;

}
void sweep(int dx, int dy)
{
    int i;
    for(i=1; i + dx - 1 <= n ; ++i )
        go_on_row(i,dx-1,dy-1);
}
int max4(int a, int b, int c, int d)
{
    return max(max(a,b),max(c,d));
}
int min4(int a, int b, int c, int d)
{
    return min(min(a,b),min(c,d));
}
void createrminq()
{
    int len_max = log2(min(n,m));
    int len;
    int i,j;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        rminq[i][j][0] = a[i][j];

    for(len = 1; len <= len_max; len ++)
    {
        int delta_check = (1<<len);
         for(i = 0; i + delta_check - 1  < n; ++i)
            for(j = 0; j + delta_check - 1 < m; ++j)
            {
                int p1,p2,p3,p4;
                int delta = 1<<(len-1);
                p1 = rminq[i][j][len - 1];
                p2 = rminq[i + delta][j][len - 1];
                p3 = rminq[i][j + delta][len - 1];
                p4 = rminq[i + delta][j + delta][len - 1];
                rminq[i][j][len] = min4(p1,p2,p3,p4);
            }
    }

}
void creatermaxq()
{
     int len_max = log2(min(n,m));
    int len;
    int i,j;
    for(i=0;i<n;i++)
        for(j=0;j<n;j++)
        rminq[i][j][0] = a[i][j];

    for(len = 1; len <= len_max; len ++)
    {
        int delta_check = (1<<len);
         for(i = 0; i + delta_check - 1  < n; ++i)
            for(j = 0; j + delta_check - 1 < m; ++j)
            {
                int p1,p2,p3,p4;
                int delta = 1<<(len-1);
                p1 = rmaxq[i][j][len - 1];
                p2 = rmaxq[i + delta][j][len - 1];
                p3 = rmaxq[i][j + delta][len - 1];
                p4 = rmaxq[i + delta][j + delta][len - 1];
                rmaxq[i][j][len] = max4(p1,p2,p3,p4);
            }
    }

}

void solve()
{

createrminq();
creatermaxq();


return;
    while(q--)
    {
        int dx,dy;
        f>>dx>>dy;
        cnt = 0;
        min_delta = INT_MAX;
        sweep(dx,dy);
        if(dx!=dy)
        sweep(dy,dx);
        g<<min_delta<<' '<<cnt<<'\n';
    }
}
void restart()
{

}

int32_t main()
{
    nos();

    read();
    solve();
    restart();

    return 0;
}