// UUID: d9768ee6-b73a-4295-859d-75391fd616e2
#include "labirintus.h"
using namespace std;
#include <cassert>
#include <cstdio>
#include <array>
#include <vector>
#include <queue>
vector<vector<int>> d;
int n,m;
const int mxn=1005;
array<int, 2> el[mxn][mxn];
int kell[mxn][mxn];
vector<array<int, 2>> dir{{0,1},{1,0},{-1,0},{0,-1}};
void init_labyrinth(int r, int c, std::vector<std::vector<int>> L) {
    n=r,m=c;
    d.assign(n+2, vector<int> (m+2, 1));
    for(int i=1; i<=n; i++)
        for(int j=1; j<=m; j++)
            d[i][j]=L[i-1][j-1];
    queue<array<int, 2>> q;
    q.push({1,1});
    el[1][1]={1,0};
    while(!q.empty())
    {
        auto [x,y]=q.front();
        q.pop();
        for(auto &[a,b]:dir)
        {
            if(!d[a+x][b+y] && !el[a+x][b+y][0])
            {
                el[a+x][b+y]={x,y};
                q.push({a+x,b+y});
            }
        }
    }
    int i=n,j=m;
    kell[1][1]=1;
    while(i!=1 || j!=1)
    {
        kell[i][j]=1;
        auto [x,y]=el[i][j];
        i=x,j=y;
    }
    return;
}
bool can_escape(int N, std::vector<int> u, std::vector<int> v) {
    bool ok=1;
    for(int i=0; i<N; i++)
    {
        if(kell[u[i]+1][v[i]+1]) ok=0;
    }
    return ok;
}

/*int main() {
    int R, C, Q;
    assert(3 == scanf("%d %d %d", &R, &C, &Q));

    std::vector<std::vector<int>> labyrinth(R, std::vector<int>(C));
    for (int i = 0; i < R; ++i) {
        for (int j = 0; j < C; ++j) {
            char c;
            assert(1 == scanf(" %c", &c));
            labyrinth[i][j] = c - '0';
        }
    }
    init_labyrinth(R, C, labyrinth);

    std::vector<int> answers(Q);
    for (int i = 0; i < Q; ++i) {
        int N;
        assert(1 == scanf("%d", &N));
        std::vector<int> U(N), V(N);
        for (int j = 0; j < N; ++j) {
            assert(2 == scanf("%d %d", &U[j], &V[j]));
        }
        answers[i] = can_escape(N, U, V);
    }

    for (int i = 0; i < Q; ++i) {
        printf("%d\n", answers[i]);
    }

    return 0;
}*/