#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,m,n) for(int i=m; i<n; ++i)
#define repl(i,m,n) for(ll i=m; i<n; ++i)

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

    sort(Y.begin(), Y.end());

    rep(i, 0, N){
        auto itr = upper_bound(Y.begin(), Y.end(), X[i]);
        if(itr == Y.end()){
            cout << "Infinity" << endl;
        }else{
            cout << *itr - X[i] << endl;
        }
    }
    return 0;
}