//ja
int n, m, x, i=0, j=0, N=0, counter=0, s, suma=0, gz;
    int min, max, nc=0, pc=0;
    bool result=0, w=1;
    scanf("%i %i", &n, &m);
    char table[n];
    int *sum=new int[n];
    int *pti=&sum[0], *ptj=&sum[0];
    //int *res=new int[m];
    int *resn[2];
    resn[0]=new int[m];
    resn[1]=new int[m];
    int *resp[2];
    resp[0]=new int[m];
    resp[1]=new int[m];
    int *wynik[2];
    wynik[0]=new int[m];
    wynik[1]=new int[m];

//chmura
 int **mergetemp,imerge,jmerge,currentmerge,
    ipow,inputlen,inputlen2,power10[8]={0,1,10,100,1000,10000,100000,1000000};
char input[16]={0};

int n,m,k,i=1,outlen=0,
    **testodd,**testeven,*vanilla,vanillas=0,odds=0,evens=0,oddresult=1,evenresult,oddleft,oddright,evenleft,evenright,**result;
    char *lolipop,*output;
    getuint2(&n,&m);
    mergetemp=(int**)malloc(2*sizeof(int*));
    mergetemp[0]=(int*)malloc(m*sizeof(int));
    mergetemp[1]=(int*)malloc(m*sizeof(int));
    testodd=(int**)malloc(2*sizeof(int*));
    testodd[0]=(int*)malloc((m+1)*sizeof(int));
    testodd[1]=(int*)malloc(m*sizeof(int));
    testeven=(int**)malloc(2*sizeof(int*));
    testeven[0]=(int*)malloc((m+1)*sizeof(int));
    testeven[1]=(int*)malloc(m*sizeof(int));
    result=(int**)malloc(2*sizeof(int*));
    result[0]=(int*)malloc(m*sizeof(int));
    result[1]=(int*)malloc(m*sizeof(int));
    vanilla=(int*)malloc(n*sizeof(int));
    lolipop=(char*)malloc((n+2)*sizeof(char));
    output=(char*)malloc(m*16*sizeof(char));
    memset(result[0],0,m*sizeof(int));