/*

Filip Barl

V. gimnazija

Zagreb, Intermediate

*/

#include <cstdio>

#include <cstdlib>

#define MAX 21

#define MOVES 4

using namespace std;

int rez[ MAX ][ MAX ], moves[ MOVES ][ 2 ] = { {0, 1}, {1, 0}, {0, -1}, {-1, 0} };

int zauz[ MAX ][ MAX ] = { { 0 } };

int cango[ MAX ][ MAX ] = { { 0 } };

void reset( void ) {

int i, j;

for( i = 0; i < MAX; ++i )

for( j = 0; j < MAX; ++j )

rez[ i ][ j ] = 0;

}

void rek( int a, int b ) {

rez[ a ][ b ]++;

int i, ta, tb;

zauz[ a ][ b ] = 1;

for( i = 0; i < MOVES; ++i ) {

ta = a + moves[ i ][ 0 ];

tb = b + moves[ i ][ 1 ];

if( cango[ ta ][ tb ] && !zauz[ ta ][ tb ] )

rek( ta, tb );

}

zauz[ a ][ b ] = 0;

}

int main( void ) {

int a, b, c, d, i;

while( 1 ) {

scanf( "%d %d", &a, &b );

if( a == 0 && b == 0 ) break;

cango[ a ][ b ] = 1;

}

for( i = 0; i < 5; ++i ) {

scanf( "%d %d %d %d", &a, &b, &c, &d );

reset();

rek( a, b );

if( rez[ c ][ d ] == 0 ) {

printf( "NONE\n" );

} else {

printf( "%d\n", rez[ c ][ d ] );

}

}

return( 0 );

}