#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(v) v.begin(),v.end()
typedef long long ll;
#define int ll
using vi = vector<int>;
using vs = vector<string>;
using P = pair<int,int>;
template<typename T> bool chmax(T &a, const T b) {if (a < b) {a = b; return true;} else return false; }
template<typename T> bool chmin(T &a, const T b) {if (a > b) {a = b; return true;} else return false; }
const int INF = 1e18;

signed main() {
   cin.tie(0);
   ios_base::sync_with_stdio(false);
   cout << fixed << setprecision(20);

   int n,m;cin>>n>>m;
   vi x(n),y(m);
   rep(i,n)cin>>x[i];
   rep(i,m)cin>>y[i];
   sort(all(y));
   rep(i,n){
       int d = *lower_bound(all(y),x[i])-x[i];
       if(d>0)cout<<d<<endl;
       else cout<<"Infinity"<<endl;
   }

   return 0;
}