#include <bits/stdc++.h>
using namespace std;

int main()
{
	int N, M;
	cin >> N >> M;
	vector<int> X( N ), Y( M );
	for( int i = 0; i < N; i++ ) cin >> X[i];
	for( int i = 0; i < M; i++ ) cin >> Y[i];

	sort( Y.begin(), Y.end() );
	for( int i = 0; i < N; i++ ) {
		int j = lower_bound( Y.begin(), Y.end(), X[i] ) - Y.begin();
		if( j >= M ) cout << "Infinity" << endl;
		else cout << Y[j] - X[i] << endl;
	}
}