#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

char*mmap();
#define rd(v) long v=0;{long _c;while(_c=*rp++-48,_c>=0)v=v*10+_c;}

char wbuf[1<<25];

#define WTHI(v) {long _z=v,_n=0,_d=0;while(++_n,_d=_d<<8|0x30|_z%10,_z/=10);*(long*)wp=_d;wp+=_n;}
#define WTLO(v) {long _z=v,_n=8,_d=0;while(_d=_d<<8|0x30|_z%10,_z/=10,--_n);*(long*)wp=_d;wp+=8;}
#define wt(v) if(v>=100000000){WTHI(v/100000000);WTLO(v);}else{WTHI(v);}

#define rep(v,e) for(long v=0;v<e;++v)

void radix_sort_aux(unsigned*a,unsigned*b,int n){
	int c[256];
	for(int i=0;i<256;++i){
		c[i]=0;
	}
	for(int i=0;i<n;++i){
		++c[a[i]&255];
	}
	int t=0;
	for(int i=0;i<256;++i){
		int u=c[i];
		c[i]=t;
		t+=u;
	}
	for(int i=0;i<n;++i){
		b[c[a[i]&255]++]=a[i]>>8|a[i]<<24;
	}
}

void radix_sort(unsigned*a,int n){
	radix_sort_aux(a,a+n,n);
	radix_sort_aux(a+n,a,n);
	radix_sort_aux(a,a+n,n);
	radix_sort_aux(a+n,a,n);
}

int x[1000],y[2000];

void f1(char*rp,long n,long m){
	rep(i,n){
		rd(xi);
		x[i]=xi;
	}
	rep(j,m){
		rd(yj);
		y[j]=yj;
	}
	radix_sort(y,m);
}

void f2(long n,long m){
	char*wp=wbuf;
	rep(i,n){
		long xi=x[i];
		long l=-1,h=m;
		while(l+1<h){
			long j=l+h>>1;
			if(y[j]<xi){
				l=j;
			}else{
				h=j;
			}
		}
		if(h<m){
			long z=y[h]-xi;
			wt(z);
			*wp++='\n';
		}else{
			memcpy(wp,"Infinity\n",9);
			wp+=9;
		}
	}
	write(1,wbuf,wp-wbuf);
	_exit(0);
}

main(){
	char*rp=mmap(0l,1l<<25,1,2,0,0ll);
	rd(n);
	rd(m);
	f1(rp,n,m);
	f2(n,m);
}