Pagini recente » Cod sursa (job #2444825) | Cod sursa (job #600531) | Cod sursa (job #3155437) | Cod sursa (job #2776137) | Cod sursa (job #2781460)
#include <iostream>
#include <fstream>
#include <vector>
#include <tuple>
#include <set>
#include <algorithm>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include<numeric>
#include <cmath>
#include <climits>
#define ll long long
using namespace std;
int main() {
std::ios::sync_with_stdio(false);
cin.tie(0);
int t;
cin >> t;
for(int z = 0; z < t; z++){
ll s, n, k, m;
cin >> s >> n >> k;
m = n - n % k;
if(s - m >= n && k != s)
cout << "NO\n";
else
cout << "YES\n";
}
return 0;
}