#include "precomp.h"

int c,d,e,*g,h,i,j,l,m,n,o,p,q,r,s,t,w,x;
char *a,*b,k,*f,*u,**v;

#define G(H) I(H) return
#define F(x) main(x,0)
#define I(H) ; break; case H: 

int main( int _, char* z[] )
{
    if( z )
    {
        w = _;
        v = z;
        t=56;
        F(21);
    }
    else switch(_)
    {
case 0:
j=0
G(1)        
b[j]
G(2)
g[i+d*j]=(a[i]-'0')*(b[j]-'0')
G(3)
j++
G(4)
i=0
G(5)
a[i]
G(6)
s=r,r=0,F(16),r=s
G(7)
i++
G(8)
n=e-1+o,o=0
G(9)
m=d-1
G(10)
c+=g[i+d*j]%_
G(11)
p=e-1+q,q=0
G(12)
i=0
G(13)
i<=h/2
G(14)
k=f[i],f[i]=f[h-i],f[h-i]=k
G(15)
i++
I(16)
_=r;
for(F(_++);F(_);F(_+2)) F(_+1)
G(17)
i=o,j=n
G(18)
i<=l
G(19)
c+=g[i+d*j]/10
G(20)
i++,j--
I(21)
_=t;F(_)?F(_+1):0
G(22)
c
G(23)
f[h++]=c+'0'
G(24)
o<d
G(25)
r=17,F(16)
G(26)
j>=0
G(27)
F(10)
G(28)
i=q,j=p
G(29)
i<=m
G(30)
t=26,
F(21)
G(31)
i++,j--
G(32)
l>d-1
G(33)
l=d-1
G(34)
m>d-1
G(35)
F(9)
G(36)
o<0
G(37)
F(8)
G(38)
q<0
G(39)
F(11)
G(40)
h=0
G(41)
h<d+e
I(42)
q=d-1-h,
p=e-1,
o=q+1,
n=p,
m=q+e-1,
l=m+1,
t=38,
F(21),
t=36,
F(21),
t=34,
F(21),
t=32,
F(21),
r=28,
F(16),
t=24,
F(21),
f[h]=(c%10)+'0',
c/=10
G(43)
h++
G(44)
f&&g
I(45)
r=4,
F(16),
c=0,
r=40,
F(16),
t=22,
F(21),
f[h--]=0,
r=12,
F(16)
G(46)
strlen(u)
G(47)
u=a,
d=F(46),
u=b,
e=F(46),
f=malloc(d+e+2),
g=malloc(d*e*sizeof(int)),
t=44,
F(21)
G(48)
x=1
G(49)
u&&(x<w)
I(50)
b=v[x];
F(47);
u=f;
if(u)
{
	free(a), a = u;
}
G(51)
x++
I(52)
G(53)
*a=='0'
G(54)
a++,0
I(55)
G(56)
w>=2
G(57)
u=a=strdup("1"),
r=48,
F(16),
r=52,
F(16),
puts(a)

; break;
    }
	return 0;
}