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

int main() {
    int n, m; cin >> n >> m; int X[n], Y[m], i;
    for(i = 0; i < n; i++)  cin >> X[i];
    for(i = 0; i < m; i++)  cin >> Y[i];
    sort(Y, Y+m);
    for(i = 0; i < n; i++) {
        auto ub = upper_bound(Y, Y+m, X[i]);
        if(ub != Y+m) cout << *ub - X[i] << endl;
        else cout << "Infinity" << endl;
    }
    return 0;
}