#include <iostream>
#include <algorithm>
#include <set>
#include <vector>
#include <set>
#include <queue>
#include <tuple>
#include <string>
using namespace std;
using ll = long long;
using ull = unsigned long long;

#define rep(i,n) for(long long i = 0; i < (int)n; i++)

#define FOR(i, m, n) for(long long i = (m);i < (n); ++i)
#define ALL(obj) (obj).begin(),(obj).end()
#define SPEED cin.tie(0);ios::sync_with_stdio(false);

template<class T> using V = vector<T>;
template<class T, class U> using P = pair<T, U>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQR = priority_queue<T,vector<T>,greater<T>>;


void print(V<ll> ar) {
    for(auto x: ar)cout << x << " " ;
    cout << endl;
}

ll gcd(ll a, ll b) {
    if (a<b)return gcd(b,a);
    if (b==0)return a;
    return gcd(b, a%b);
}

ll mpow(ll x, ll n, ll p) {
    ll r = 1;
    while (n>0) {
        if (n%2) {
            r*=x;
            r%=p;
        }
        x *= x;
        x %= p;
        n/=2;
    }
    return r;
}
const ll mod = 998244353;

ll f(ll rest, ll a) {
    ll r = 0;
    rep(i, a) {
        //cout << rest+i+1 << " " << mpow((rest+i+1)%mod, mod-2, mod) << endl;
        r += mpow((rest+i+1)%mod, mod-2, mod);
    }
    return r;
}


int main()
{
    int n, m;
    cin >> n >> m;
    V<int> x(n),y(m);
    rep(i, n)cin >> x[i];
    rep(i, m)cin >> y[i];
    sort(y.begin(), y.end());
    rep(i, n) {
        int z = m;
        rep(j, m) {
            if (x[i]<y[j]) {
                z = j;
                break;
            }
        }
        if (z==m)cout << "Infinity" << endl;
        else cout << y[z]-x[i] << endl;
    }
}