This documentation is automatically generated by online-judge-tools/verification-helper
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_5_K
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#include "../../mod/mint.cpp"
#include "../../combinatorics/enumeration.cpp"
#undef call_from_test
signed main(){
int n,k;
scanf("%d %d",&n,&k);
printf("%d\n",(n<=k));
return 0;
}
#line 1 "test/aoj/DPL_5_K.test.cpp"
// verification-helper: PROBLEM http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DPL_5_K
#include<bits/stdc++.h>
using namespace std;
#define call_from_test
#line 1 "mod/mint.cpp"
#line 3 "mod/mint.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<typename T, T MOD = 1000000007>
struct Mint{
inline static constexpr T mod = MOD;
T v;
Mint():v(0){}
Mint(signed v):v(v){}
Mint(long long t){v=t%MOD;if(v<0) v+=MOD;}
Mint pow(long long k){
Mint res(1),tmp(v);
while(k){
if(k&1) res*=tmp;
tmp*=tmp;
k>>=1;
}
return res;
}
static Mint add_identity(){return Mint(0);}
static Mint mul_identity(){return Mint(1);}
Mint inv(){return pow(MOD-2);}
Mint& operator+=(Mint a){v+=a.v;if(v>=MOD)v-=MOD;return *this;}
Mint& operator-=(Mint a){v+=MOD-a.v;if(v>=MOD)v-=MOD;return *this;}
Mint& operator*=(Mint a){v=1LL*v*a.v%MOD;return *this;}
Mint& operator/=(Mint a){return (*this)*=a.inv();}
Mint operator+(Mint a) const{return Mint(v)+=a;}
Mint operator-(Mint a) const{return Mint(v)-=a;}
Mint operator*(Mint a) const{return Mint(v)*=a;}
Mint operator/(Mint a) const{return Mint(v)/=a;}
Mint operator+() const{return *this;}
Mint operator-() const{return v?Mint(MOD-v):Mint(v);}
bool operator==(const Mint a)const{return v==a.v;}
bool operator!=(const Mint a)const{return v!=a.v;}
static Mint comb(long long n,int k){
Mint num(1),dom(1);
for(int i=0;i<k;i++){
num*=Mint(n-i);
dom*=Mint(i+1);
}
return num/dom;
}
};
template<typename T, T MOD>
ostream& operator<<(ostream &os,Mint<T, MOD> m){os<<m.v;return os;}
//END CUT HERE
#ifndef call_from_test
signed main(){
return 0;
}
#endif
#line 1 "combinatorics/enumeration.cpp"
#line 3 "combinatorics/enumeration.cpp"
using namespace std;
#endif
//BEGIN CUT HERE
template<typename M_>
class Enumeration{
using M = M_;
protected:
inline static vector<M> fact,finv,invs;
public:
static void init(int n){
n=min<decltype(M::mod)>(n,M::mod-1);
int m=fact.size();
if(n<m) return;
fact.resize(n+1,1);
finv.resize(n+1,1);
invs.resize(n+1,1);
if(m==0) m=1;
for(int i=m;i<=n;i++) fact[i]=fact[i-1]*M(i);
finv[n]=M(1)/fact[n];
for(int i=n;i>=m;i--) finv[i-1]=finv[i]*M(i);
for(int i=m;i<=n;i++) invs[i]=finv[i]*fact[i-1];
}
static M Fact(int n){
init(n);
return fact[n];
}
static M Finv(int n){
init(n);
return finv[n];
}
static M Invs(int n){
init(n);
return invs[n];
}
static M C(int n,int k){
if(n<k or k<0) return M(0);
init(n);
return fact[n]*finv[n-k]*finv[k];
}
static M P(int n,int k){
if(n<k or k<0) return M(0);
init(n);
return fact[n]*finv[n-k];
}
// put n identical balls into k distinct boxes
static M H(int n,int k){
if(n<0 or k<0) return M(0);
if(!n and !k) return M(1);
init(n+k);
return C(n+k-1,n);
}
};
//END CUT HERE
#ifndef call_from_test
//INSERT ABOVE HERE
signed main(){
return 0;
}
#endif
#line 9 "test/aoj/DPL_5_K.test.cpp"
#undef call_from_test
signed main(){
int n,k;
scanf("%d %d",&n,&k);
printf("%d\n",(n<=k));
return 0;
}