#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

int main() {
  int n, m;
  cin >> n >> m;
  vector<int> x(n);
  rep(i, n) cin >> x.at(i);
  vector<int> y(m);
  rep(i, m) cin >> y.at(i);
  set<int> se;
  for(auto i : y) se.insert(i);
  rep(i, n) {
    auto itr = se.upper_bound(x.at(i));
    if(itr == se.end()) cout << "Infinity" << endl;
    else cout << *itr-x.at(i) << endl;
  }
  return 0;
}