#include <bits/stdc++.h>
using namespace std;
#include <atcoder/all>
using namespace atcoder;
using ll=long long;
using Graph=vector<vector<int>>;
#define INF 1000000000
#define MOD 998244353
#define MAX 200000

int main(){
  int N,M;
  cin>>N>>M;
  vector<pair<int,int>> nums;
  for(int i=0;i<N;i++){
    int X;
    cin>>X;
    nums.push_back(make_pair(X,i));
  }
  for(int i=0;i<M;i++){
    int Y;
    cin>>Y;
    nums.push_back(make_pair(Y,-1));
  }
  sort(nums.begin(),nums.end());

  vector<int> ans(N);
  int obs=2*INF;
  for(int i=N+M-1;i>=0;i--){
    if(nums[i].second==-1){
      obs=nums[i].first;
    }else{
      if(obs==2*INF){
        ans[nums[i].second]=obs;
      }else{
        ans[nums[i].second]=obs-nums[i].first;
      }
    }
  }

  for(int i=0;i<N;i++){
    if(ans[i]==2*INF){
      cout<<"Infinity"<<'\n';
    }else{
      cout<<ans[i]<<'\n';
    }
  }
}