#include<stdio.h>

#include<string.h>

#include<algorithm>

using namespace std;

const int MAX = ;

bool ma[MAX][MAX];

int lft[MAX][MAX],rht[MAX][MAX],up[MAX][MAX],down[MAX][MAX];

int len[MAX];

int rows,cols,q;

void upd_row(int x)

{

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

    {

        if(ma[x][j])

            lft[x][j] = lft[x][j-]+;

        else lft[x][j]=;

    }

    for(int j=cols; j>=; j--)

    {

        if(ma[x][j])

            rht[x][j]=rht[x][j+]+;

        else rht[x][j] =;

    }

}

void upd_col(int y)

{

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

    {

        if(ma[i][y])

            up[i][y] = +up[i-][y];

        else up[i][y] = ;

    }

    for(int i=rows; i>=; i--)

    {

        if(ma[i][y])

            down[i][y]=+down[i+][y];

        else down[i][y]=;

    }

}

int go(int tmp,int n)

{

    int leftmost = tmp;

    int rightmost = tmp;

    int ret = ;

    for(int final = len[tmp]; final >=; final--)

    {

        while(leftmost>= && final<=len[leftmost])

            --leftmost;

        while(rightmost<=n && final<=len[rightmost])

            ++rightmost;

        ret = max(ret,final*(rightmost-leftmost-));

    }

    return ret;

}

int main()

{

    int i,j;

    int op,x,y;

    int ans;

    while(scanf("%d %d %d",&rows,&cols,&q)!=EOF)

    {

        for(i=; i<=rows; i++)

            for(j=; j<=cols; j++)

                scanf("%d",&ma[i][j]);

        for(i=; i<=rows; i++)

            upd_row(i);

        for(j=; j<=cols; j++)

            upd_col(j);

        while(q--)

        {

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

            if(op==)

            {

                ma[x][y]=!ma[x][y];

                //for(i=1; i<=rows; i++)

                    upd_row(x);

                //for(j=1; j<=cols; j++)

                    upd_col(y);

            }

            else

            {

                ans=;

                for(i=; i<=rows; i++)len[i]=lft[i][y];

                ans=max(ans,go(x,rows));

                for(i=; i<=rows; i++)len[i]=rht[i][y];

                ans=max(ans,go(x,rows));

                for(j=; j<=cols; j++)len[j]=down[x][j];

                ans=max(ans,go(y,cols));

                for(j=; j<=cols; j++)len[j]=up[x][j];

                ans=max(ans,go(y,cols));

                printf("%d\n",ans);

            }

        }

    }

    return ;

}