#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> P;
typedef vector<ll> VI;
typedef vector<VI> VVI;
#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin(),v.end()
template<typename T> bool chmax(T &x, const T &y) {return (x<y)?(x=y,true):false;};
template<typename T> bool chmin(T &x, const T &y) {return (x>y)?(x=y,true):false;};
constexpr ll MOD=998244353;
constexpr ll INF=2e18;

int main(){
    int n, m; cin >> n >> m;
    VI x(n), y(m);
    REP(i,n) cin >> x[i];
    REP(i,m) cin >> y[i];
    REP(i,n){
        auto it=lower_bound(ALL(y),x[i]);
        if(it==y.end())
            cout << "Infinity" << endl;
        else
            cout << *it-x[i] << endl;
    }
}