codeforces 1101A

#include<bits/stdc++.h>

using namespace std;

/// Typedef
typedef long long ll;

#define sc1(a) scanf("%lld",&a)
#define sc2(a,b) scanf("%lld %lld",&a,&b)

#define pf1(a) printf("%lld\n",a)
#define pf2(a,b) printf("%lld %lld\n",a,b)

#define mx 10000007
#define mod 100000007
#define PI acos(-1.0)

int dr[] = {-2,-2,-1,-1,1,1,2,2};
int dc[] = {-1,1,-2,2,-2,2,-1,1};


int main()
{
    ll num, m, tc = 1;

    sc1(tc);
    while (tc--){
        ll l, r, d;
        cin >> l >> r >> d;
        if(d < l || r < d)  cout << d << endl;
        else{
            ll ans = r / d + 1;
            pf1(ans * d);
        }
    }

    return 0;
}