#include<bits/stdc++.h>
#define LL long long
#define ULL unsigned long long

#define scs(i) scanf("%s", i)
#define sci(i) scanf("%d", &i)
#define scd(i) scanf("%lf", &i)
#define scl(i) scanf("%lld", &i)
#define scIl(i) scanf("%I64d", &i)
#define scii(i, j) scanf("%d %d", &i, &j)
#define scdd(i, j) scanf("%lf %lf", &i, &j)
#define scll(i, j) scanf("%lld %lld", &i, &j)
#define scIll(i, j) scanf("%I64d %I64d", &i, &j)
#define sciii(i, j, k) scanf("%d %d %d", &i, &j, &k)
#define scddd(i, j, k) scanf("%lf %lf %lf", &i, &j, &k)
#define sclll(i, j, k) scanf("%lld %lld %lld", &i, &j, &k)
#define scIlll(i, j, k) scanf("%I64d %I64d %I64d", &i, &j, &k)

#define lson l, m, rt<<1
#define rson m+1, r, rt<<1|1
#define lowbit(i) (i & (-i))
#define mem(i, j) memset(i, j, sizeof(i))

#define fir first
#define sec second
#define ins(i) insert(i)
#define pb(i) push_back(i)
#define pii pair<int, int>
#define mk(i, j) make_pair(i, j)
#define all(i) i.begin(), i.end()
#define pll pair<long long, long long>
using namespace std;
;
, , -, };
, , , };
, n, m, k, G[][maxn];
set<pii> s;

void PRINT()
{
    ; i<=n; i++){
        ; j<=m; j++){
            ) printf("- ");
            else printf("%d ", G[i][j]);
        }puts("");
    }puts("");
}

bool bound(int r, int c)
{  || c< || r>n || c>m); }

void DFS(int r, int c)
{
    //PRINT();

    if(s.count(mk(r, c))) return;
    else s.ins(mk(r, c));

    ; i<; i++){
        ){
            int _1 = c + dc[i];
            *dc[i];
            if(bound(r, _1)) continue;
            if(bound(r, _2)) continue;
            if(G[r][_1] == G[r][_2]){
                G[r][_2] = -;
                G[r][c] = G[r][_1];
                DFS(r, _2);
                G[r][_2] = G[r][_1];
                G[r][c] = -;
            }
        }){
            int _1 = r + dr[i];
            *dr[i];
            if(bound(_1, c)) continue;
            if(bound(_2, c)) continue;
            if(G[_1][c] == G[_2][c]){
                G[_2][c] = -;
                G[r][c] = G[_1][c];
                DFS(_2, c);
                G[_2][c] = G[_1][c];
                G[r][c] = -;
            }
        }
    }
}

int main(void)
{
    while(~sciii(n, m, k)){
        mem(G, -);
        s.clear();
        ; i<k; i++){
            int r1, c1;
            int r2, c2;
            scii(r1, c1);
            scii(r2, c2);
            G[r1][c1] = cnt;
            G[r2][c2] = cnt++;
        }

        ;
        ; i<=n; i++){
            ; j<=m; j++)
                ){
                    st_r = i;
                    st_c = j;
                    Find = ;
                    break;
                }
            if(Find) break;
        }

        DFS(st_r, st_c);

        printf();
    }
    ;
}