#define mod 1000000007
#include<time.h>
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<map>
#include<queue>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
typedef long long ll;
const ll inf=0x7fffffffffffffff;
const int inf=0x7fffffff;
const int n=2e5+5;
clock_t start,finish;
void time_in(){start=clock();}
void time_out(){finish=clock();double tim=(double)(finish-start)/clocks_per_sec;printf("running time is %lf\n",tim);}
ll mul(ll a,ll b){ll s=0;while(b){if(b&1)s=(s+a)%mod;a=(a<<1)%mod;b>>=1;}return s%mod;}
ll pow_mul(ll a,ll b){ll s=1;while(b){if(b&1)s=mul(s,a);a=mul(a,a);b>>=1;}return s;}
ll poww(ll a,ll b){ll s=1;while(b){if(b&1)s=(s*a)%mod;a=(a*a)%mod;b>>=1;}return s%mod;}
int t,cas;
int n,m,k;
int main()
{
	int a,b;
	while(~scanf("%d%d",&a,&b))
	{
		if(a<b)
		{
			printf("0\n");
			printf("%d is less than %d, so we should print 0.\n",a,b);
		}
		else
		{
			printf("10\n");
			printf("%d is not less than %d, so we should print 10.\n",a,b);
		}
	}
}
