//OJ 1847
 //by Cydiater
 //2015.9.22
 #include <iostream>
 #include <cstdio>
 #include <cstdlib>
 #include <cstring>
 #include <string>
 #include <algorithm>
 #include <queue>
 #include <map>
 #include <ctime>
 #include <cmath>
 #include <iomanip>
 using namespace std;
 #define ll long long
 #define up(i,j,n)        for(int i=j;i<=n;i++)
 #define down(i,j,n)        for(int i=j;i>=n;i--)
 ;
 const int oo=0x3f3f3f3f;
 inline ll read(){
     ,f=;
     ;ch=getchar();}
     +ch-';ch=getchar();}
     return x*f;
 }
 ll N,L,I,f[][];
 namespace solution{
     void init(){
         N=read();L=read();I=read();
         memset(f,,sizeof(f));
     }
     void slove(){
         up(i,,)f[i][]=;
         up(i,,N)up(j,,L)f[i][j]=f[i-][j-]+f[i-][j];
         up(i,,N)up(j,,L)f[i][j]+=f[i][j-];
         down(i,N,)
             ][L]<I&&I>){
                 printf(");
                 I-=f[i-][L];
                 L--;
                 //cout<<i<<' '<<L<<' '<<f[i-1][L]<<' '<<I<<endl;
             }");
     }
 }
 int main(){
     //freopen("input.in","r",stdin);
     using namespace solution;
     init();
     slove();
     ;
 }