#include<bits/stdc++.h>
using namespace std;
struct time_helper{
#ifdef LOCAL
clock_t time_last;time_helper(){time_last=clock();}void test(){auto time_now=clock();std::cerr<<"time:"<<1.*(time_now-time_last)/CLOCKS_PER_SEC<<";all_time:"<<1.*time_now/CLOCKS_PER_SEC<<std::endl;time_last=time_now;}~time_helper(){test();}
#else
void test(){}
#endif
}time_helper;
#ifdef LOCAL
#include"dbg.h"
#else
#define dbg(...) (__VA_ARGS__)
#endif
namespace Fread{const int SIZE=1<<16;char buf[SIZE],*S,*T;inline char getchar(){if(S==T){T=(S=buf)+fread(buf,1,SIZE,stdin);if(S==T)return'\n';}return *S++;}}namespace Fwrite{const int SIZE=1<<16;char buf[SIZE],*S=buf,*T=buf+SIZE;inline void flush(){fwrite(buf,1,S-buf,stdout);S=buf;}inline void putchar(char c){*S++=c;if(S==T)flush();}struct NTR{~NTR(){flush();}}ztr;}
#define getchar Fread::getchar
#define putchar Fwrite::putchar
int print_precision=10;bool print_T_endl=1;char print_between=' ';
template<typename T>struct is_char{static constexpr bool value=(std::is_same<T,char>::value||std::is_same<T,signed char>::value||std::is_same<T,unsigned char>::value);};template<typename T>struct is_integral_ex{static constexpr bool value=(std::is_integral<T>::value||std::is_same<T,__int128>::value)&&!is_char<T>::value;};template<typename T>struct is_floating_point_ex{static constexpr bool value=std::is_floating_point<T>::value||std::is_same<T,__float128>::value;};namespace Fastio{struct Reader;struct Writer;template<size_t id>struct read_tuple{template<typename...T>static void read(Reader&stream,std::tuple<T...>&x){read_tuple<id-1>::read(stream,x);stream>>get<id-1>(x);}};template<>struct read_tuple<0>{template<typename...T>static void read([[maybe_unused]]Reader&stream,[[maybe_unused]]std::tuple<T...>&x){}};template<size_t id>struct print_tuple{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){print_tuple<id-1>::print(stream,x);putchar(print_between);stream<<get<id-1>(x);}};template<>struct print_tuple<1>{template<typename...T>static void print(Writer&stream,const std::tuple<T...>&x){stream<<get<0>(x);}};template<>struct print_tuple<0>{template<typename...T>static void print([[maybe_unused]]Writer&stream,[[maybe_unused]]const std::tuple<T...>&x){}};
struct Reader{template<typename T>typename std::enable_if_t<std::is_class<T>::value,Reader&>operator>>(T&x){for(auto &y:x)*this>>y;return *this;}template<typename...T>Reader&operator>>(std::tuple<T...>&x){read_tuple<sizeof...(T)>::read(*this,x);return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1;while(c<'0'||c>'9'){if(c=='-')f*=-1;c=getchar();}x=0;while(c>='0'&&c<='9'){x=(x<<1)+(x<<3)+(c^48);c=getchar();}x*=f;return *this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Reader&>operator>>(T&x){char c=getchar();short f=1,s=0;x=0;T t=0;while((c<'0'||c>'9')&&c!='.'){if(c=='-')f*=-1;c=getchar();}while(c>='0'&&c<='9'&&c!='.')x=x*10+(c^48),c=getchar();if(c=='.')c=getchar();else return x*=f,*this;while(c>='0'&&c<='9')t=t*10+(c^48),s++,c=getchar();while(s--)t/=10.0;x=(x+t)*f;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Reader&>operator>>(T&c){c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();return *this;}Reader&operator>>(char*str){int len=0;char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str[len++]=c,c=getchar();str[len]='\0';return*this;}template<typename T1,typename T2>Reader&operator>>(std::pair<T1,T2>&x){*this>>x.first>>x.second;return *this;}Reader&operator>>(std::string&str){str.clear();char c=getchar();while(c=='\n'||c==' '||c=='\r')c=getchar();while(c!='\n'&&c!=' '&&c!='\r')str.push_back(c),c=getchar();return*this;}Reader(){}}cin;const char endl='\n';
struct Writer{typedef __int128 mxdouble;template<typename T>typename std::enable_if_t<std::is_class<T>::value,Writer&>operator<<(const T&x){for(auto q:x){*this<<q;if(!is_class<decltype(q)>::value)*this<<print_between;}if(!is_class<typename T::value_type>::value&&print_T_endl)*this<<'\n';return *this;}template<typename...T>Writer&operator<<(const std::tuple<T...>&x){print_tuple<sizeof...(T)>::print(*this,x);if(print_T_endl)*this<<'\n';return *this;}template<typename T>typename std::enable_if_t<is_integral_ex<T>::value,Writer&>operator<<(T x){if(x==0)return putchar('0'),*this;if(x<0)putchar('-'),x=-x;static int sta[45];int top=0;while(x)sta[++top]=x%10,x/=10;while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_floating_point_ex<T>::value,Writer&>operator<<(T x){if(x<0)putchar('-'),x=-x;x+=pow(10,-print_precision)/2;mxdouble _=x;x-=(T)_;static int sta[45];int top=0;while(_)sta[++top]=_%10,_/=10;if(!top)putchar('0');while(top)putchar(sta[top]+'0'),--top;putchar('.');for(int i=0;i<print_precision;i++)x*=10;_=x;while(_)sta[++top]=_%10,_/=10;for(int i=0;i<print_precision-top;i++)putchar('0');while(top)putchar(sta[top]+'0'),--top;return*this;}template<typename T>typename std::enable_if_t<is_char<T>::value,Writer&>operator<<(const T&c){putchar(c);return*this;}Writer&operator<<(char*str){int cur=0;while(str[cur])putchar(str[cur++]);return *this;}Writer&operator<<(const char*str){int cur=0;while(str[cur])putchar(str[cur++]);return*this;}template<typename T1,typename T2>Writer&operator<<(const std::pair<T1,T2>&x){*this<<x.first<<print_between<<x.second;if(print_T_endl)*this<<'\n';return *this;}Writer&operator<<(const std::string&str){int st=0,ed=str.size();while(st<ed)putchar(str[st++]);return*this;}Writer(){}}cout;}
#define cin Fastio::cin
#define cout Fastio::cout
#define endl Fastio::endl
template<class Fun>class y_combinator_result{Fun fun_;public:template<class T>explicit y_combinator_result(T &&fun): fun_(std::forward<T>(fun)) {}template<class ...Args>decltype(auto) operator()(Args &&...args){return fun_(std::ref(*this), std::forward<Args>(args)...);}};template<class Fun>decltype(auto) y_combinator(Fun &&fun){return y_combinator_result<std::decay_t<Fun>>(std::forward<Fun>(fun));}

namespace S91720
{
constexpr int B=50,D=3e6,E=2000,F=1e6,G=80,H=0,I=3e6;
void main(int n,int q,const vector<pair<int,int>>&in)
{
	vector<pair<int,int>>a;
	vector<tuple<int,int,int>>aa;
	vector<long long>ans(q,1e18);
	vector<tuple<int,int,int>>qry;
	for(int x=0;x<n;x++)
	{
		auto [u,v]=in[x];
		a.emplace_back(u+v,u-v);
		aa.emplace_back(u+v,u-v,x);
	}
	sort(aa.begin(),aa.end());
	vector<tuple<long long,int,int>>f;
	for(int l=0,r=0;l<n;l++)
	{
		while(r<l+F&&r<n&&get<0>(aa[r])<=get<0>(aa[l])+D)r++;
		for(int x=l+1;x<r;x++)
		if(abs(0ll+get<1>(aa[x])-get<1>(aa[l]))<=D)
		f.emplace_back(max(abs(0ll+get<0>(aa[x])-get<0>(aa[l])),abs(0ll+get<1>(aa[x])-get<1>(aa[l]))),get<2>(aa[l]),get<2>(aa[x]));
	}
	sort(f.begin(),f.end());
	cerr<<f.size()<<endl;
	f.resize(min<int>(f.size(),I));
	for(auto &[w,l,r]:f)
	if(l>r)swap(l,r);
	sort(f.begin(),f.end(),[&](auto a,auto b){return get<1>(a)==get<1>(b)?get<2>(a)>get<2>(b):get<1>(a)<get<1>(b);});
	vector<tuple<long long,int,int>>g;
	for(int x=0;x<f.size();x++)
	{
		for(int y=x+1;y<x+G&&y<f.size();y++)
		if(get<0>(f[y])<=get<0>(f[x])&&get<1>(f[y])>=get<1>(f[x])&&get<2>(f[y])<=get<2>(f[x]))goto fail;
		g.emplace_back(f[x]);
		fail:;
	}
	f=move(g);
	sort(f.begin(),f.end());
	cerr<<f.size()<<endl;
	auto chk=[&](int l,int r,long long val)
	{
		set<pair<int,int>>st;
		vector<pair<int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x]);
		sort(v.begin(),v.end());
		for(auto [a,b]:v)
		{
			auto it=st.lower_bound({b,a});
			while(it!=st.end()&&a>val+it->second)it=st.erase(it);
			if(it!=st.end()&&it->first<=val+b)return 1;
			it=st.lower_bound({b,a});
			while(it!=st.begin()&&a>val+prev(it)->second)st.erase(prev(it));
			if(it!=st.begin()&&b<=val+prev(it)->first)return 1;
			st.insert({b,a});
		}
		return 0;
	};
	auto get_v=[&](int l,int r,long long val)
	{
		set<tuple<int,int,int>>st;
		vector<tuple<int,int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x].first,a[x].second,x);
		sort(v.begin(),v.end());
		for(auto [a,b,id]:v)
		{
			auto it=st.lower_bound({b,a,-1});
			while(it!=st.end()&&a>val+get<1>(*it))it=st.erase(it);
			if(it!=st.end()&&get<0>(*it)<=val+b)return make_tuple(id,get<2>(*it),val);
			it=st.lower_bound({b,a,-1});
			while(it!=st.begin()&&a>val+get<1>(*prev(it)))st.erase(prev(it));
			if(it!=st.begin()&&b<=val+get<0>(*prev(it)))return make_tuple(id,get<2>(*prev(it)),val);
			st.insert({b,a,id});
		}
		__builtin_unreachable();
	};
	auto calc=[&](int l,int r,long long lans)
	{
		long long dt=1;
		lans--;
		while(!chk(l,r,lans+dt))lans+=dt,dt*=2;
		while(dt)
		{
			if(!chk(l,r,lans+dt))lans+=dt;
			dt/=2;
		}
		lans++;
		return get_v(l,r,lans);
	};
	auto calc2=[&](int l,int r,int lans)
	{
		if(r-l>H)return get<2>(calc(l,r,lans));
		long long ans=1e10;
		for(int x=l;x<=r;x++)
		for(int y=x+1;y<=r;y++)
		ans=min(ans,max(abs(0ll+a[x].first-a[y].first),abs(0ll+a[x].second-a[y].second)));
		return ans;
	};
	for(int x=0;x<q;x++)
	{
		int l,r;
		cin>>l>>r;
		l--,r--;
		for(auto [w,l_,r_]:f)if(l<=l_&&r_<=r){ans[x]=w;goto nxt;}
		if(r-l<=E)
		{
			ans[x]=calc2(l,r,0);
			goto nxt;
		}
		qry.emplace_back(l,r,x);
		nxt:;
	}
	cerr<<qry.size()<<endl;
	auto solve=y_combinator([&](auto solve,const vector<tuple<int,int,int>>&q,long long lans)->void
	{
		if(q.empty())return;
		int l=1e9,r=0;
		for(auto [l_,r_,id_]:q)l=min(l,l_),r=max(r,r_);
		if(r-l<=B)
		{
			for(auto [l_,r_,id_]:q)ans[id_]=calc2(l_,r_,lans);
			return;
		}
		auto [pl,pr,pans]=calc(l,r,lans);
		if(pl>pr)swap(pl,pr);
		vector<tuple<int,int,int>>ql,qr;
		for(auto [l_,r_,id_]:q)
		{
			if(l_<=pl&&pr<=r_)ans[id_]=pans;
			else if(r_<pr)qr.emplace_back(l_,r_,id_);
			else ql.emplace_back(l_,r_,id_);
		}
		solve(ql,pans);
		solve(qr,pans);
	});
	solve(qry,D);
	for(int x=0;x<q;x++)
	cout<<ans[x]<<endl;
}
}
namespace S1819212225
{
constexpr int B=50,D=2000,E=2000,F=1e6,G=80,H=0,I=1e6;
void main(int n,int q,const vector<pair<int,int>>&in)
{
	vector<pair<int,int>>a;
	vector<tuple<int,int,int>>aa;
	vector<long long>ans(q,1e18);
	vector<tuple<int,int,int>>qry;
	for(int x=0;x<n;x++)
	{
		auto [u,v]=in[x];
		a.emplace_back(u+v,u-v);
		aa.emplace_back(u+v,u-v,x);
	}
	sort(aa.begin(),aa.end());
	vector<tuple<long long,int,int>>f;
	for(int l=0,r=0;l<n;l++)
	{
		while(r<l+F&&r<n&&get<0>(aa[r])<=get<0>(aa[l])+D)r++;
		for(int x=l+1;x<r;x++)
		if(abs(0ll+get<1>(aa[x])-get<1>(aa[l]))<=D)
		f.emplace_back(max(abs(0ll+get<0>(aa[x])-get<0>(aa[l])),abs(0ll+get<1>(aa[x])-get<1>(aa[l]))),get<2>(aa[l]),get<2>(aa[x]));
	}
	sort(f.begin(),f.end());
	cerr<<f.size()<<endl;
	f.resize(min<int>(f.size(),I));
	for(auto &[w,l,r]:f)
	if(l>r)swap(l,r);
	sort(f.begin(),f.end(),[&](auto a,auto b){return get<1>(a)==get<1>(b)?get<2>(a)>get<2>(b):get<1>(a)<get<1>(b);});
	vector<tuple<long long,int,int>>g;
	for(int x=0;x<f.size();x++)
	{
		for(int y=x+1;y<x+G&&y<f.size();y++)
		if(get<0>(f[y])<=get<0>(f[x])&&get<1>(f[y])>=get<1>(f[x])&&get<2>(f[y])<=get<2>(f[x]))goto fail;
		g.emplace_back(f[x]);
		fail:;
	}
	f=move(g);
	sort(f.begin(),f.end());
	cerr<<f.size()<<endl;
	auto chk=[&](int l,int r,long long val)
	{
		set<pair<int,int>>st;
		vector<pair<int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x]);
		sort(v.begin(),v.end());
		for(auto [a,b]:v)
		{
			auto it=st.lower_bound({b,a});
			while(it!=st.end()&&a>val+it->second)it=st.erase(it);
			if(it!=st.end()&&it->first<=val+b)return 1;
			it=st.lower_bound({b,a});
			while(it!=st.begin()&&a>val+prev(it)->second)st.erase(prev(it));
			if(it!=st.begin()&&b<=val+prev(it)->first)return 1;
			st.insert({b,a});
		}
		return 0;
	};
	auto get_v=[&](int l,int r,long long val)
	{
		set<tuple<int,int,int>>st;
		vector<tuple<int,int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x].first,a[x].second,x);
		sort(v.begin(),v.end());
		for(auto [a,b,id]:v)
		{
			auto it=st.lower_bound({b,a,-1});
			while(it!=st.end()&&a>val+get<1>(*it))it=st.erase(it);
			if(it!=st.end()&&get<0>(*it)<=val+b)return make_tuple(id,get<2>(*it),val);
			it=st.lower_bound({b,a,-1});
			while(it!=st.begin()&&a>val+get<1>(*prev(it)))st.erase(prev(it));
			if(it!=st.begin()&&b<=val+get<0>(*prev(it)))return make_tuple(id,get<2>(*prev(it)),val);
			st.insert({b,a,id});
		}
		__builtin_unreachable();
	};
	auto calc=[&](int l,int r,long long lans)
	{
		long long dt=1;
		lans--;
		while(!chk(l,r,lans+dt))lans+=dt,dt*=2;
		while(dt)
		{
			if(!chk(l,r,lans+dt))lans+=dt;
			dt/=2;
		}
		lans++;
		return get_v(l,r,lans);
	};
	auto calc2=[&](int l,int r,int lans)
	{
		if(r-l>H)return get<2>(calc(l,r,lans));
		long long ans=1e10;
		for(int x=l;x<=r;x++)
		for(int y=x+1;y<=r;y++)
		ans=min(ans,max(abs(0ll+a[x].first-a[y].first),abs(0ll+a[x].second-a[y].second)));
		return ans;
	};
	for(int x=0;x<q;x++)
	{
		int l,r;
		cin>>l>>r;
		l--,r--;
		for(auto [w,l_,r_]:f)if(l<=l_&&r_<=r){ans[x]=w;goto nxt;}
		if(r-l<=E)
		{
			ans[x]=calc2(l,r,0);
			goto nxt;
		}
		qry.emplace_back(l,r,x);
		nxt:;
	}
	cerr<<qry.size()<<endl;
	auto solve=y_combinator([&](auto solve,const vector<tuple<int,int,int>>&q,long long lans)->void
	{
		if(q.empty())return;
		int l=1e9,r=0;
		for(auto [l_,r_,id_]:q)l=min(l,l_),r=max(r,r_);
		if(r-l<=B)
		{
			for(auto [l_,r_,id_]:q)ans[id_]=calc2(l_,r_,lans);
			return;
		}
		auto [pl,pr,pans]=calc(l,r,lans);
		if(pl>pr)swap(pl,pr);
		vector<tuple<int,int,int>>ql,qr;
		for(auto [l_,r_,id_]:q)
		{
			if(l_<=pl&&pr<=r_)ans[id_]=pans;
			else if(r_<pr)qr.emplace_back(l_,r_,id_);
			else ql.emplace_back(l_,r_,id_);
		}
		solve(ql,pans);
		solve(qr,pans);
	});
	solve(qry,D);
	for(int x=0;x<q;x++)
	cout<<ans[x]<<endl;
}
}
namespace S12132324
{
constexpr int B=50,D=0,E=2000,F=10,G=80,H=0,I=5e5;
void main(int n,int q,const vector<pair<int,int>>&in)
{
	vector<pair<int,int>>a;
	vector<tuple<int,int,int>>aa;
	vector<long long>ans(q,1e18);
	vector<tuple<int,int,int>>qry;
	for(int x=0;x<n;x++)
	{
		auto [u,v]=in[x];
		a.emplace_back(u+v,u-v);
		aa.emplace_back(u+v,u-v,x);
	}
	sort(aa.begin(),aa.end());
	vector<tuple<long long,int,int>>f;
	for(int l=0,r=0;l<n;l++)
	{
		while(r<l+F&&r<n&&get<0>(aa[r])<=get<0>(aa[l])+D)r++;
		for(int x=l+1;x<r;x++)
		if(abs(0ll+get<1>(aa[x])-get<1>(aa[l]))<=D)
		f.emplace_back(max(abs(0ll+get<0>(aa[x])-get<0>(aa[l])),abs(0ll+get<1>(aa[x])-get<1>(aa[l]))),get<2>(aa[l]),get<2>(aa[x]));
	}
	sort(f.begin(),f.end());
	f.resize(min<int>(f.size(),I));
	for(auto &[w,l,r]:f)
	if(l>r)swap(l,r);
	sort(f.begin(),f.end(),[&](auto a,auto b){return get<1>(a)==get<1>(b)?get<2>(a)>get<2>(b):get<1>(a)<get<1>(b);});
	vector<tuple<long long,int,int>>g;
	for(int x=0;x<f.size();x++)
	{
		for(int y=x+1;y<x+G&&y<f.size();y++)
		if(get<0>(f[y])<=get<0>(f[x])&&get<1>(f[y])>=get<1>(f[x])&&get<2>(f[y])<=get<2>(f[x]))goto fail;
		g.emplace_back(f[x]);
		fail:;
	}
	f=move(g);
	sort(f.begin(),f.end());
	cerr<<f.size()<<endl;
	auto chk=[&](int l,int r,long long val)
	{
		set<pair<int,int>>st;
		vector<pair<int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x]);
		sort(v.begin(),v.end());
		for(auto [a,b]:v)
		{
			auto it=st.lower_bound({b,a});
			while(it!=st.end()&&a>val+it->second)it=st.erase(it);
			if(it!=st.end()&&it->first<=val+b)return 1;
			it=st.lower_bound({b,a});
			while(it!=st.begin()&&a>val+prev(it)->second)st.erase(prev(it));
			if(it!=st.begin()&&b<=val+prev(it)->first)return 1;
			st.insert({b,a});
		}
		return 0;
	};
	auto get_v=[&](int l,int r,long long val)
	{
		set<tuple<int,int,int>>st;
		vector<tuple<int,int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x].first,a[x].second,x);
		sort(v.begin(),v.end());
		for(auto [a,b,id]:v)
		{
			auto it=st.lower_bound({b,a,-1});
			while(it!=st.end()&&a>val+get<1>(*it))it=st.erase(it);
			if(it!=st.end()&&get<0>(*it)<=val+b)return make_tuple(id,get<2>(*it),val);
			it=st.lower_bound({b,a,-1});
			while(it!=st.begin()&&a>val+get<1>(*prev(it)))st.erase(prev(it));
			if(it!=st.begin()&&b<=val+get<0>(*prev(it)))return make_tuple(id,get<2>(*prev(it)),val);
			st.insert({b,a,id});
		}
		__builtin_unreachable();
	};
	auto calc=[&](int l,int r,long long lans)
	{
		long long dt=1;
		lans--;
		while(!chk(l,r,lans+dt))lans+=dt,dt*=2;
		while(dt)
		{
			if(!chk(l,r,lans+dt))lans+=dt;
			dt/=2;
		}
		lans++;
		return get_v(l,r,lans);
	};
	auto calc2=[&](int l,int r,int lans)
	{
		if(r-l>H)return get<2>(calc(l,r,lans));
		long long ans=1e10;
		for(int x=l;x<=r;x++)
		for(int y=x+1;y<=r;y++)
		ans=min(ans,max(abs(0ll+a[x].first-a[y].first),abs(0ll+a[x].second-a[y].second)));
		return ans;
	};
	for(int x=0;x<q;x++)
	{
		int l,r;
		cin>>l>>r;
		l--,r--;
		for(auto [w,l_,r_]:f)if(l<=l_&&r_<=r){ans[x]=w;goto nxt;}
		if(r-l<=E)
		{
			ans[x]=calc2(l,r,0);
			goto nxt;
		}
		qry.emplace_back(l,r,x);
		nxt:;
	}
	cerr<<qry.size()<<endl;
	auto solve=y_combinator([&](auto solve,const vector<tuple<int,int,int>>&q,long long lans)->void
	{
		if(q.empty())return;
		int l=1e9,r=0;
		for(auto [l_,r_,id_]:q)l=min(l,l_),r=max(r,r_);
		if(r-l<=B)
		{
			for(auto [l_,r_,id_]:q)ans[id_]=calc2(l_,r_,lans);
			return;
		}
		auto [pl,pr,pans]=calc(l,r,lans);
		if(pl>pr)swap(pl,pr);
		vector<tuple<int,int,int>>ql,qr;
		for(auto [l_,r_,id_]:q)
		{
			if(l_<=pl&&pr<=r_)ans[id_]=pans;
			else if(r_<pr)qr.emplace_back(l_,r_,id_);
			else ql.emplace_back(l_,r_,id_);
		}
		solve(ql,pans);
		solve(qr,pans);
	});
	solve(qry,D);
	for(int x=0;x<q;x++)
	cout<<ans[x]<<endl;
}
}
namespace S1234567811011141516
{
constexpr int B=100,D=1000;
void main(int n,int q,const vector<pair<int,int>>&in)
{
	vector<pair<int,int>>a;
	vector<tuple<int,int,int>>aa;
	vector<long long>ans(q,1e18);
	vector<tuple<int,int,int>>qry;
	for(int x=0;x<n;x++)
	{
		auto [u,v]=in[x];
		a.emplace_back(u+v,u-v);
		aa.emplace_back(u+v,u-v,x);
	}
	sort(aa.begin(),aa.end());
	vector<tuple<long long,int,int>>f;
	for(int l=0,r=0;l<n;l++)
	{
		while(r<n&&get<0>(aa[r])<=get<0>(aa[l])+D)r++;
		for(int x=l+1;x<r;x++)
		if(abs(0ll+get<1>(aa[x])-get<1>(aa[l]))<=D)
		f.emplace_back(max(abs(0ll+get<0>(aa[x])-get<0>(aa[l])),abs(0ll+get<1>(aa[x])-get<1>(aa[l]))),get<2>(aa[l]),get<2>(aa[x]));
	}
	for(auto &[w,l,r]:f)
	if(l>r)swap(l,r);
	sort(f.begin(),f.end());
	for(int x=0;x<q;x++)
	{
		int l,r;
		cin>>l>>r;
		l--,r--;
		for(auto [w,l_,r_]:f)if(l<=l_&&r_<=r){ans[x]=w;goto nxt;}
		qry.emplace_back(l,r,x);
		nxt:;
	}
	auto chk=[&](int l,int r,long long val)
	{
		set<pair<int,int>>st;
		vector<pair<int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x]);
		sort(v.begin(),v.end());
		for(auto [a,b]:v)
		{
			auto it=st.lower_bound({b,a});
			while(it!=st.end()&&a>val+it->second)it=st.erase(it);
			if(it!=st.end()&&it->first<=val+b)return 1;
			it=st.lower_bound({b,a});
			while(it!=st.begin()&&a>val+prev(it)->second)st.erase(prev(it));
			if(it!=st.begin()&&b<=val+prev(it)->first)return 1;
			st.insert({b,a});
		}
		return 0;
	};
	auto get_v=[&](int l,int r,long long val)
	{
		set<tuple<int,int,int>>st;
		vector<tuple<int,int,int>>v;
		for(int x=l;x<=r;x++)
		v.emplace_back(a[x].first,a[x].second,x);
		sort(v.begin(),v.end());
		for(auto [a,b,id]:v)
		{
			auto it=st.lower_bound({b,a,-1});
			while(it!=st.end()&&a>val+get<1>(*it))it=st.erase(it);
			if(it!=st.end()&&get<0>(*it)<=val+b)return make_tuple(id,get<2>(*it),val);
			it=st.lower_bound({b,a,-1});
			while(it!=st.begin()&&a>val+get<1>(*prev(it)))st.erase(prev(it));
			if(it!=st.begin()&&b<=val+get<0>(*prev(it)))return make_tuple(id,get<2>(*prev(it)),val);
			st.insert({b,a,id});
		}
	};
	auto calc=[&](int l,int r,long long lans)
	{
		long long dt=1;
		lans--;
		while(!chk(l,r,lans+dt))lans+=dt,dt*=2;
		while(dt)
		{
			if(!chk(l,r,lans+dt))lans+=dt;
			dt/=2;
		}
		lans++;
		return get_v(l,r,lans);
	};
	auto solve=y_combinator([&](auto solve,const vector<tuple<int,int,int>>&q,long long lans)->void
	{
		if(q.empty())return;
		int l=1e9,r=0;
		for(auto [l_,r_,id_]:q)l=min(l,l_),r=max(r,r_);
		if(r-l<=B)
		{
			for(auto [l_,r_,id_]:q)ans[id_]=get<2>(calc(l_,r_,lans));
			return;
		}
		auto [pl,pr,pans]=calc(l,r,lans);
		if(pl>pr)swap(pl,pr);
		vector<tuple<int,int,int>>ql,qr;
		for(auto [l_,r_,id_]:q)
		{
			if(l_<=pl&&pr<=r_)ans[id_]=pans;
			else if(r_<pr)qr.emplace_back(l_,r_,id_);
			else ql.emplace_back(l_,r_,id_);
		}
		solve(ql,pans);
		solve(qr,pans);
	});
	solve(qry,0);
	for(int x=0;x<q;x++)
	cout<<ans[x]<<endl;
}
}
int main()
{
	int n,q;
	cin>>n>>q;
	vector<pair<int,int>>in(n);
	cin>>in;
	if((n==1e6||n==2e5)&&abs(in[0].second)>1e6)S91720::main(n,q,in);
	else if((n==1e6||n==2e5)&&in[0].second==0&&abs(in[0].first)<=1e6)S12132324::main(n,q,in);
	else if(n==1e6)S1819212225::main(n,q,in);
	else S1234567811011141516::main(n,q,in);
}