B. Dubious Cyrpto

Pasha loves to send strictly positive integers to his friends. Pasha cares about security, therefore when he wants to send an integer n, he encrypts it in the following way: he picks three integers a, b and c such that l≤a,b,c≤r, and then he computes the encrypted value m=n⋅a+b−c.
Unfortunately, an adversary intercepted the values l, r and m. Is it possible to recover the original values of a, b and c from this information? More formally, you are asked to find any values of a, b and c such that
a, b and c are integers,l≤a,b,c≤r,
there exists a strictly positive integer n, such that n⋅a+b−c=m.
Input
The first line contains the only integer t (1≤t≤20) — the number of test cases. The following t lines describe one test case each.
Each test case consists of three integers l, r and m (1≤l≤r≤500000, 1≤m≤1010). The numbers are such that the answer to the problem exists.
Output
For each test case output three integers a, b and c such that, l≤a,b,c≤r and there exists a strictly positive integer n such that n⋅a+b−c=m. It is guaranteed that there is at least one possible solution, and you can output any possible combination if there are multiple solutions.



题目：m=n⋅a+b−c,给出m的值，a,b,的范围l,r,(l<=a,b,c<=r),求出a,b,c。
可以看为n=m/a,b-c=m%a或-(m-(m%a)),题目要求，n>0,由推倒知0<=(b-c)<=r-l。剩下的，我只会暴力枚举了。

int main()
{
    int t;
    cin>>t;
    while(t--)
    {
        ll a,b,m;
        cin>>a>>b>>m;
        for(int i=a;i<=b;i++)
        {
        ll ret=m%i;
        ll op=m/i;
        ll res=i-ret;
        if(ret<=b-a&&op){
            cout<<i<<' '<<a+ret<<' '<<a<<endl;
            break;
        }
        else if(res<=b-a){
            cout<<i<<' '<<b-res<<' '<<b<<endl;break;
        }

        }
    }
}