#include // {{{ // https://codeforces.com/blog/entry/96344 #pragma GCC optimize("O2,unroll-loops") #pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt") using namespace std; template constexpr T MIN = std::numeric_limits::min(); template constexpr T MAX = std::numeric_limits::max(); template [[nodiscard]] static T sc(auto &&x) { return static_cast(x); } template [[nodiscard]] static T sz(auto &&x) { return static_cast(x.size()); } template void pr(std::format_string fmt, Args &&...args) { std::print(fmt, std::forward(args)...); } template void pr(std::format_string fmt) { std::print(fmt); } template void prln(std::format_string fmt, Args &&...args) { std::println(fmt, std::forward(args)...); } template void prln(std::format_string fmt) { std::println(fmt); } void prln() { std::println(); } void prln(auto const &t) { std::println("{}", t); } #ifdef LOCAL #define dbgln(...) prln(...) #define dbg(...) pr(...) #endif using ll = long long; using ld = long double; template using vec = std::vector; template using arr = std::array; #define ff first #define ss second #define eb emplace_back #define pb push_back #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() // }}} void solve() { int n, k, p; cin >> n >> k >> p; k = abs(k); int ans = k / p; k -= p * ans; if (k) { ++ans; } cout << (ans > n ? -1 : ans) << endl; } int main() { // {{{ cin.tie(nullptr)->sync_with_stdio(false); int t = 1; cin >> t; while (t--) { solve(); } return 0; } // }}}