/*
TASK:ZIGZAG
LANG:C++
*/
#include<iostream>
#include<cmath>
using namespace std;
int a[100][100];
int main()
{
    int n,k,i=0,j=3,br=2,check=1;
    cin>>n>>k;
    for(i=0;i<=n+1;i++)
    {
    a[0][i]=1;
    a[i][0]=1;
    a[n+1][n+1-i]=1;
    a[i][n+1]=1;
    }
    i=1;j=1; 
    a[1][1]=1;
    while(br!=n*n+1)
    {
    if(!a[i-1][j+1]) {a[i-1][j+1]=br;i--;j++;br++;continue;}
    if(!a[i+1][j-1]) {a[i+1][j-1]=br;i++;j--;br++;continue;}
    check=abs(check-1);
    if(!check)
    {
    if(!a[i][j+1]) {a[i][j+1]=br;j++;br++;continue;}
    else {a[i+1][j]=br;i++;br++;continue;}
    }
    else
    {
        if(!a[i+1][j]) {a[i+1][j]=br;i++;br++;continue;}
        else {a[i][j+1]=br;j++;br++;continue;}
    } 
    }
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    if(a[i][j]==k) cout<<i<<" "<<j<<endl;
    return 0;
}
