#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
#include <array>
#include <bitset>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    vector<int> x(n);
    for(int i=0;i<n;i++){
        cin >> x[i];
    }
    set<int> st;
    const int inf = 2e9;
    st.insert(inf);
    for(int i=0;i<m;i++){
        int y; cin >> y;
        st.insert(y);
    }
    for(int i=0;i<n;i++){
        auto it = st.lower_bound(x[i]);
        if(*it == inf){
            cout << "Infinity" << "\n";
        }
        else{
            cout << *it-x[i] << "\n";
        }
    }
}