#define ATCODER #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define VL vector #define VVL vector> #define VP vector< pair > #define VVP vector>> #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define MP(a,b) make_pair(a,b) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } template T det2(array ar){ return ar[0] * ar[3] - ar[1] * ar[2]; } template T det3(array ar){ return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6];} template bool chmax(T& tar, T src){return tar < src ? tar = src, true : false;} template bool chmin(T& tar, T src){return tar > src ? tar = src, true : false;} template void inc(vector& ar){for(auto&v:ar) v++;} template void dec(vector& ar){for(auto&v:ar) v--;} template vector> id_sort(vector& a){ vector res(a.size()); for(int i=0; i>n>>m>>a>>b>>c>>d; auto calc=[&](ll x){ if(x<0||x>=n) return ll(-1e18); return a*x+b*((c*x+d)/m); }; ll ans = max(calc(0),calc(n-1)); if(c==0){ cout<a1){ r=m1; }else{ l=m0; } } ll m0=l+1; ll v0=(m0*m-1)/c; ll a0=max(calc(v0),calc(v0+1)); chmax(ans,a0); cout<> t; while (t--) { solve(); } return 0; }