#include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
#include <set>
#include <cstdio>

using namespace std;

const int inf = 1001001001;

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());
  y.push_back(inf);
  m++;
  for (int i = 0; i < n; i++) {
    int j = upper_bound(y.begin() , y.end() , x[i]) - y.begin();
    if (y[j] == inf) cout << "Infinity" << endl;
    else cout << y[j] - x[i] << endl;
  }
  return 0;
}