#include <bits/stdc++.h>
#include "nice_lines.h"
typedef long double ld;
typedef long long ll;
using namespace std;
ll M = 1e4;
const ll POS = 33333;
const ld EPS = 0.005;
vector <int> a;
vector <int> b;
vector <ll> points;
void solverange(ld a1, ld b1, ld a2, ld b2){
    ld p = -(b1 - b2)/(a1 - a2);
    ld x = query(POS, p);
    //cout<<a1<<' '<<b1<<' '<<a2<<' '<<b2<<' '<<x<<' '<<p<<'\n';
    if(abs(x - p*a1 - b1) <= EPS){
        points.push_back(round(p));
    }else{
        ///get slope again
        ld x2 = query(POS, p + 1);
        ///should be few and far between?
        ld a3 = x2 - x;
        ld b3 = x - p*a3;
        solverange(a1, b1, a3, b3);
        solverange(a3, b3, a2, b2);
    }
}
void solve(int subtask_id, int n) {
    if(subtask_id == 4){
        M = 500;
    }
    ll RANGE = (POS + 1)*M;
    ld a2 = query(POS, -RANGE);
    ld b2 = query(POS, -RANGE - 1);
    ld c = query(POS, RANGE);
    ld d = query(POS, RANGE + 1);
    solverange((ld)(a2 - b2), a2 + (ld)(a2 - b2)*RANGE, (ld)(d - c), c - (ld)(d - c)*RANGE);
    for(auto i : points){
        ll x = POS, y = i;
        ll a2, b2;
        a2 = (y + M + RANGE*x)/x - RANGE;
        b2 = y - a2*POS;
        a.push_back(a2);
        b.push_back(b2);
    }
    the_lines_are(a, b);
}