EASY

#include <iostream> using namespace std;  int main() {     int long long n, k, x;     cin >> n >> k >> x;     int long long k_min = (n - 1) * x + 1;     int long long k_max = (n + 1) * x - 1;     if (k < k_min || k > k_max)         cout << -1;     else {         int long long more = k - k_min;         int long long lerf_more = more / 2;         int long long right_more = more - lerf_more;         cout << x - lerf_more << ' ' << n* x + right_more;     } }