#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
typedef long long LL;
int main()
{int T;scanf("%d", &T);while(T--){LL n, k, sq, cnt;scanf("%lld%lld", &n, &k);sq = (LL)sqrt(double(n));if(n < sq*(sq+1)) cnt = sq+sq-1;else cnt = sq+sq;printf("%lld ", cnt);if(k <= cnt-sq) printf("%lld\n", n/k);else printf("%lld\n", cnt+1-k);}
}

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int c[22], d[22], a[22], p[22];
int main()
{int T;scanf("%d", &T);while(T--){int m, k;scanf("%d%d", &m, &k);for(int i = 0; i < m; i++)scanf("%d%d", &a[i], &p[i]);int sum = 0;for(int i = 0; i < k; i++)scanf("%d%d", &c[i], &d[i]), sum += c[i]*d[i];int ans = 1000000000, ans_novip = sum;for(int i = 0; i < m; i++){int sum_vip = 0;for(int j = 0; j < k; j++)sum_vip += (d[j] * (100-p[i]) + 99) / 100 * c[j];sum_vip = min(max(sum_vip, a[i]), ans_novip);ans = min(ans, sum_vip);}printf("%d\n", (ans+9)/10);}return 0;
}

#include <iostream>
#include <cstdio>
#include <cassert>
#include <cmath>
using i64 = long long;
using u64 = unsigned long long;
using u128 = __uint128_t;
struct Mod64
{Mod64() : n_(0) {}Mod64(u64 n) : n_(init(n)) {}static u64 modulus() { return mod; }static u64 init(u64 w) { return reduce(u128(w) * r2); }static void set_mod(u64 m){mod = m;assert(mod & 1);inv = m;for (int i = 0; i < 5; ++i)inv *= 2 - inv * m;r2 = -u128(m) % m;}static u64 reduce(u128 x){u64 y = u64(x >> 64) - u64((u128(u64(x) * inv) * mod) >> 64);return i64(y) < 0 ? y + mod : y;}Mod64 &operator+=(Mod64 rhs){n_ += rhs.n_ - mod;if (i64(n_) < 0)n_ += mod;return *this;}Mod64 operator+(Mod64 rhs) const { return Mod64(*this) += rhs; }Mod64 &operator*=(Mod64 rhs){n_ = reduce(u128(n_) * rhs.n_);return *this;}Mod64 operator*(Mod64 rhs) const { return Mod64(*this) *= rhs; }u64 get() const { return reduce(n_); }static u64 mod, inv, r2;u64 n_;
};
u64 Mod64::mod, Mod64::inv, Mod64::r2;inline u64 mod128_64_small(u128 a, u64 b)
{u64 q, r;__asm__("divq\t%4": "=a"(q), "=d"(r): "0"(u64(a)), "1"(u64(a >> 64)), "rm"(b));return r;
}u64 fact_mod_fast(int N, u64 mod)
{Mod64::set_mod(mod);Mod64 ret = Mod64(1), one = ret, t = one;for (int i = 1; i <= N; ++i){ret *= t;t += one;}return ret.get();
}
int main()
{int T;scanf("%d", &T);while(T--){u64 a0_, a1_, m0_, m1_, c_, M, k;scanf("%llu%llu%llu%llu%llu%llu%llu", &a0_, &a1_, &m0_, &m1_, &c_, &M, &k);Mod64 :: set_mod(M);Mod64 a0 = Mod64(a0_);Mod64 a1 = Mod64(a1_);Mod64 m0 = Mod64(m0_);Mod64 m1 = Mod64(m1_);Mod64 c = Mod64(c_);Mod64 ans = a0*a1;Mod64 a2;for(int i = 2; i <= k; i++){a2 = m0*a1+m1*a0+c;ans = ans * a2;a0 = a1;a1 = a2;}printf("%llu\n", ans.get());}
}

LL multi(LL x,LL y,LL mod)
{LL tmp = (x * y - (LL)((long double) x / mod * y + 1.0e-8) * mod);return tmp < 0 ? tmp+mod : tmp;//x*y%mod
}