//Normal

#define _GLIBCXX_DEBUG
#define ll long long
#include <bits/stdc++.h>
using namespace std;
using Graph = vector<vector<int>>;

void print(auto a){
  cout << a;
}

void prints(auto a){
  cout << a << " ";
}

void prints(){
  cout << " ";
}

void printl(auto a){
  cout << a << endl;
}

void printl(){
  cout << endl;
}

void fix(int n){
  cout << fixed << setprecision(n);
}

int main(){
  int N, M; cin >> N >> M;
  vector<int> A(N), B(M+1, 2e9);
  for(int i = 0; i < N; i++) cin >> A[i];
  for(int i = 0; i < M; i++) cin >> B[i];
  
  sort(B.begin(), B.end());
  for(int i = 0; i < N; i++){
    int ng = -1, ok = M+1;
    
    while(ng+1 < ok){
      int mid = (ng+ok)/2;
      
      A[i] <= B[mid] ? ok = mid : ng = mid;
    }
    
    B[ok] == 2e9 ? printl("Infinity") : printl(B[ok]-A[i]);
  }
  
  return 0;
}