#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
//using mint = modint998244353;
using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N, M;
  cin >> N >> M;
  vector<ll> X(N), Y(M);
  for (ll i = 0; i < N; i++)
  {
    cin >> X.at(i);
  }
  for (ll i = 0; i < M; i++)
  {
    cin >> Y.at(i);
  }

  sort(Y.begin(), Y.end());
  Y.push_back(INF);

  for (auto x : X)
  {
    auto it = lower_bound(Y.begin(), Y.end(), x);
    //cerr << *it << " ";
    if (*it == INF)
      cout << "Infinity" << endl;
    else
      cout << *it - x << endl;
  }
}