#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;
using ll = long long;

int main(){

    int N, M;
    cin >> N >> M;
    vector<int> X(N), Y(M);
    for (int i=0; i<N; i++) cin >> X[i];
    for (int i=0; i<M; i++) cin >> Y[i];
    sort(Y.begin(), Y.end());
    for (int i=0; i<N; i++){
        auto it = lower_bound(Y.begin(), Y.end(), X[i]);
        if (it == Y.end()) cout << "Infinity" << endl;
        else cout << *it-X[i] << endl;
    }

    return 0;
}