#include <bits/stdc++.h>

using namespace std;

int main() {
	int n, m;
	cin >> n >> m;

	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, y+m);

	for (int i = 0; i < n; i++) {
		if (lower_bound(y, y+m, x[i])-y == m) {
			puts("Infinity");
		} else {
			cout << (*lower_bound(y, y+m, x[i]))-x[i] << endl;
		}
	}

	return 0;
}