#include<bits/stdc++.h>
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
#define pii pair<ll,ll>
#define rep(i,a,b) for(ll i=(a);i<=(b);++i)
#define per(i,a,b) for(ll i=(a);i>=(b);--i)
using namespace std;
bool Mbe;
ll read(){
    ll x=0,f=1;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
    return x*f;
}
void write(ll x){
    if(x<0)putchar('-'),x=-x;
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
const ll N=1e6+9;
ll T,n,L,R;
ll Getnum(ll n){
    ll i=1;
    while(n){
        ll s=(1ll<<i);
        if(i>1)s-=(1ll<<(i-1));
        if(n>s*i)n-=s*i,i++;
        else break;
    }
    ll st=(i==1?0ll:(1ll<<(i-1)));
    ll cnt=(n-1)/i;
    st=st+cnt;
    return st;
}
bool Get(ll n){
    ll i=1;
    while(n){
        ll s=(1ll<<i);
        if(i>1)s-=(1ll<<(i-1));
        if(n>s*i)n-=s*i,i++;
        else break;
    }
    ll st=(i==1?0ll:(1ll<<(i-1)));
    ll cnt=(n-1)/i;
    st=st+cnt;
    n-=cnt*i;
    return (st>>(i-n))&1;
}
ll Getstart(ll n){
    ll i=1,pos=0;
    while(n){
        ll s=(1ll<<i);
        if(i>1)s-=(1ll<<(i-1));
        if(n>s)n-=s,pos+=s*i,i++;
        else break;
    }
    return pos+n*i+1;
}
ll Mg(ll x,ll y){
    ll rx=x,ry=y;
    rep(i,0,n-1){
        bool px=Get(x),py=Get(y);
        if(px>py)return rx;
        if(px<py)return ry;
        x++,y++;
    }
    return rx;
}
bool Intersect(ll l,ll r,ll ql,ll qr){
    if(l>qr||r<ql)return 0;
    return 1;
}
bool Intersect2(ll l,ll r,ll u,ll a,ll b){
    l=max(l,u),r=min(r,u+(1ll<<b)*((1ll<<(a-b+1))-1));
    if(l>r)return 0;
    l-=u,r-=u;
    l=(l+(1ll<<b)-1)>>b;
    r>>=b;
    return l<=r;
}
bool Intersect3(ll l,ll r,ll u,ll a,ll b,ll c){
    l=max(l,u),r=min(r,u+(1ll<<b)*((1ll<<(a-b+1))-1)+(1ll<<c)-1);
    if(l>r)return 0;
    l-=u,r-=u;
    ll tl=l>>b;
    ll tr=r>>b;
    if(tl<tr)return 1;
    return (l&((1ll<<b)-1))<=(1ll<<c)-1;
}
void solve(){
    L=read(),R=read(),n=read();
    if(R-n+1-L+1<=60){
        ll bst=L;
        rep(i,L+1,R-n+1)bst=Mg(bst,i);
        rep(i,0,n-1)write(Get(bst+i));
        putchar('\n');
        return ;
    }
    ll pl=Getnum(L);
    vector<ll>valid;
    rep(i,L,min(R-n+1,L+56))valid.push_back(i);
    rep(i,max(L,R-n+1-56),R-n+1)valid.push_back(i);
    ll pr=Getnum(R-n+1);
    if(Getstart(pr+1)-1>R-n+1)pr--;
    rep(i,2,55){
        ll cur=0;
        per(k,i-1,0){
            ll ncur=((cur<<1ll)|1ll)<<k;
            if(Intersect(pl,pr,ncur,ncur+(1ll<<k)-1))cur=(cur<<1ll)|1ll;
            else cur=(cur<<1ll);
        }
        ll st=Getstart(cur);
        if(st>=L&&st<=R-n+1)valid.push_back(st);
        rep(j,0,i-3){
            ll cur=0;
            per(k,j,0){
                ll ncur=((cur<<1ll)|1ll)<<k;
                if(Intersect3(pl,pr,(1ll<<(i-1))+ncur,i-2,j+2,k))cur=(cur<<1ll)|1ll;
                else cur=(cur<<1ll);
            }
            cur|=(1ll<<(i-1));
            per(k,i-2,j+2){
                ll ncur=cur|(1ll<<k);
                if(k==j+2){
                    if(Intersect(pl,pr,ncur,ncur))cur|=(1ll<<k);
                }
                else {
                    if(Intersect2(pl,pr,ncur,k-1,j+2))cur|=(1ll<<k);
                }
            }
            ll st=Getstart(cur)+(i-j-1);
            if(st>=L&&st<=R-n+1)valid.push_back(st);
        }
    }
    sort(valid.begin(),valid.end());
    valid.resize(unique(valid.begin(),valid.end())-valid.begin());
    ll bst=valid[0];
    rep(i,1,(ll)valid.size()-1)bst=Mg(bst,valid[i]);
    rep(i,0,n-1)write(Get(bst+i));
    putchar('\n');
}
bool Med;
int main(){
    cerr<<fabs(&Med-&Mbe)/1048576.0<<"MB\n";
    T=read();
    while(T--)solve();
    cerr<<"\n"<<clock()*1.0/CLOCKS_PER_SEC*1000<<"ms\n";
    return 0;
}