#include<bits/stdc++.h> using namespace std; #define ll long long #define int long long #define sh short #define LD long double #define lson (pos<<1) #define rson (pos<<1|1) #define pii pair<int,int> #define fr first #define sc second #define mk make_pair #define pb push_back #define x1 lylakioi #define y1 gczakioi #define lb(x) (x&(-x)) #define hb(x) ((int)(__lg(x))) #define popcnt __builtin_popcount #define inx(u) int I=h[(u)],v=edge[I].v;I;I=edge[I].nx,v=edge[I].v #define inv(u) int I=ls[u],v=son[I];I<=rs[u];++I,v=son[I] // #define mid ((l+r)>>1) // #pragma gcc optimize(2) int read(){int x=0,f=1;char c=getchar();while(c>'9'||c<'0'){if(c=='-')f=-1;c=getchar();}x=c-'0';c=getchar();while(c<='9'&&c>='0'){x*=10;x+=c-'0';c=getchar();}return x*f;} string reads(){string res=".";char c=getchar();while(c<'a'||c>'z')c=getchar();while(c>='a'&&c<='z')res=res+c,c=getchar();return res;} void write(int x){if(x<0){putchar('-');x=-x;}if(x>9) write(x/10);putchar(x%10+'0');} const int MAXN=1510,N=16,Mod=1e9+7; void add(int &x,int y){x+=y;if(x>=Mod)x-=Mod;}int ad(int x,int y){return x+y>=Mod?x+y-Mod:x+y;}int dl(int x,int y){return x-y<0?x-y+Mod:x-y;} struct Edge{int v,nx;}edge[MAXN<<1];int h[MAXN],CNT;void add_side(int u,int v){edge[++CNT]={v,h[u]};h[u]=CNT;edge[++CNT]={u,h[v]};h[v]=CNT;} int t,n,m,a[MAXN]; void slv(){ t=read(),n=read(),m=read(); t=3; printf("90\n"); printf("& %d %d %d\n",1,2,3); printf("| %d %d %d\n",1,2,1); printf("& %d %d %d\n",3,3,2); printf("^ 1 2 3\n"); printf(">> %d %d %d\n",1,1,a[0]=++t); for(int i=1;i<=N;i++) printf(">> %d %d %d\n",a[i-1],1<<i-1,a[i]=++t), printf("& %d %d %d\n",a[i-1],a[i],a[i]); t++; for(int i=N;i>=0;i--){ printf("& %d %d %d\n",a[i],2,a[i]); printf("<< %d %d %d\n",a[i],1<<i,a[i]); printf("| %d %d %d\n",2,a[i],2); } printf("<< 2 1 2\n"); printf("^ 2 3 3\n"); } signed main(){ //freopen("1.in","r",stdin); //freopen("1.out","w",stdout); // int _=read();while(_--) slv(); // cout<<(char(33))<<endl; // cerr<<clock()*1.0/CLOCKS_PER_SEC<<"s\n"; return 0; }