#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cmath>

#define rep(i,n) for(i=0; i<n; ++i)
#define in(a) cin >> a
#define out(a,b) cout << a << b
using namespace std;
using lint = long long;

int main(void){
    lint i, j;
    lint n, m;
    in(n);
    in(m);
    vector<int> x(n); vector<int> y(m);
    rep(i,n)    in(x[i]);
    rep(i,m)    in(y[i]);
    sort(y.begin(), y.end());
    rep(i,n){
        auto it = lower_bound(y.begin(), y.end(), x[i]);
        if(it==y.end()) out("Infinity", endl);
        else    out(*it-x[i], endl);
    }
    return 0;
}