UVA_11498_Divison_Nlogonia

#include <stdio.h>
#include <stdlib.h>

int main(int argc, char** argv) {
    int k; /*number of queries*/
    int x,y,m,n;
    int i;
    while(scanf("%d",&k)){
        if (k==0) break;/*exit*/
        scanf("%d %d",&x,&y);/*coordinates of division*/
        for(i=0;i<k;i++){
            scanf("%d %d",&m,&n);
            if ((m>x) &&(n>y)){
                printf("NE\n");
            }/*NO CASE*/
            if ((m>x)&&(n<y))
                printf("SE\n");
            if ((m<x)&&(n<y))
                printf("SO\n");
            if ((m<x)&&(n>y))
                printf("NO\n");
            if ((m==x)||(n==y))
                printf("divisa\n");
        }
    }
    return (EXIT_SUCCESS);
}