#include<cstdio>
#include<cmath>
#include<algorithm>
using namespace std;
int n,m,x,y,w,ans;
int a[100005][3],tot;
inline int read()
{
    char ch;
    int x=0;
    ch=getchar();
    while(ch<'0'||ch>'9')
        ch=getchar();
    while(ch>='0'&&ch<='9')
    {
        x=(x<<3)+(x<<1)+ch-'0';
        ch=getchar();
    }
    return x;
}
int main()
{
    freopen("monkeygame.in","r",stdin);
    freopen("monkeygame.out","w",stdout);
    n=read(),m=read();
//    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        x=read(),y=read();
//        scanf("%d%d",&x,&y);
        a[++tot][1]=x;a[tot][2]=y;
    }
    for(int i=1;i<=m;i++)
    {
        w=read(),x=read(),y=read();
//        scanf("%d%d%d",&w,&x,&y);
        if(w&1){a[++tot][1]=x;a[tot][2]=y;} 
        else
        {
            ans=300000;    
            for(int j=1;j<=tot;j++) 
                if(a[j][1]==x&&a[j][2]==y) 
                {ans=0;break;}
                else ans=min(ans,abs(a[j][1]-x)+abs(a[j][2]-y));
            printf("%d\n",ans);
        }
    }
    return 0;
}