/*
TASK:zigzag
LANG:C++
*/
#include <iostream>
using namespace std;
int i,j,br,gd,s,v,a[102][102],n,k,p,red;
char ch;
void f()
{
     for (;;)
         {
         a[i][j]=++br;
         if (i==red-1&&!j) break;
         i++;j--;
         s++;
         }
}
void f2()
{
     for(;;)
            {
            a[i][j]=++br;
            if (!i&&j==red-1) break;
            i--;j++;
            s++;
            }
}
void f3()
{
     for (;;)
         {
         a[i][j]=++br;
         if (i==(n-1)&& j==red) break;
         i++;j--;
         }
}
void f4()
{
    for (;;)
         {
         a[i][j]=++br;
         if (j==n-1&&i==red) break;
         i--;j++;
         }
}
int main()
{
    cin>>n>>k;gd=1;a[i][j]=++br;
    for (;br<(n*n);)
            {
            if (i==0&&j==0) red++;
            if (s==n-1) {v=1;red=0;}
            s=0;
            if (v!=1)
            { red++;
            if (gd==1) {j++;f();gd=0;}
            else
            {i++;f2();gd=1;}
            }
            else
            { red++;
                if (gd==1) { i++;f3();gd=0;}
                else {j++;f4();gd=1;}
            }}
    for (i=0;i<n;i++)
        for (j=0;j<n;j++)
            if (a[i][j]==k) cout<<i+1<<' '<<j+1<<endl;
            return 0;
}

            
