#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=3e5+5,M=3e5+5,K=600+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(time(0));
int a,b;
void Solve(){
	int i,j;scanf("%d%d",&a,&b);
	string A,B;
	int x=a;while(x) A+='0'+x%10,x/=10;reverse(A.begin(),A.end());
	x=b;while(x) B+='0'+x%10,x/=10;reverse(B.begin(),B.end());
	while(A.size()<B.size()) A+='.';
	while(A.size()>B.size()) B+='.';
	for(int i=0;i<A.size();i++) if(A[i]^B[i]){
		if(A[i]<B[i]) printf("%d<%d\n",a,b);
		else printf("%d>%d\n",a,b);
		return;
	}
	printf("%d=%d\n",a,b);
}
int main(){
	int t;
	// scanf("%d",&t);
	t=1;
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}