#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
#include <bits/stdc++.h>
using namespace std;
#define _rep(i_,a_,b_) for(int i_ = (a_); i_ <= (b_); ++i_)
#define mid ((L+R) / 2)
#define multiCase() int testCnt = in(); _rep(curCase,1,testCnt)
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
using ll = long long;
using pii = pair<int,int>;

namespace FastIO {
char buf[1 << 23], *p1 = buf, *p2 = buf;
inline char gc(void) {
	if(p1 == p2 && (p1 = buf, p2 = buf + fread(buf, 1, 1 << 23, stdin), p1 == p2)) return EOF;
	return *p1++;
}
int in(void) {
	int x = 0, c = gc(), f = 1; while(!isdigit(c)) { if(c == '-') f = -1; c = gc(); }
	while(isdigit(c)) x = x * 10 + c - '0', c = gc();
	return x * f;
}
ll inl(void) {
	ll x = 0; int c = gc(), f = 1; while(!isdigit(c)) { if(c == '-') f = -1; c = gc(); }
	while(isdigit(c)) x = x * 10 + c - '0', c = gc();
	return x * f;
}
char obuf[1 << 23], *p3 = obuf;
inline void pc(char c) { *p3++ = c; if(p3 == obuf + (1 << 23)) fwrite(obuf, 1, 1 << 23, stdout), p3 = obuf; }
template<typename T> void out_(T x) { if(x > 9) out_(x / 10); pc(x % 10 + '0'); }
template<typename T> void out(T x) { if(x < 0) pc('-'), x = -x; out_(x); pc(' '); }
template<typename T> void outln(T x) { if(x < 0) pc('-'), x = -x; out_(x); pc('\n'); } 
struct FLUSHer { ~FLUSHer() { fwrite(obuf, 1, p3 - obuf, stdout); } } flusher;
} using FastIO::in; using FastIO::inl; using FastIO::out; using FastIO::outln;
template<typename T> void chkmax(T &a, const T &b) { a = max(a, b); } 
template<typename T> void chkmin(T &a, const T &b) { a = min(a, b); } 
const int kN = 205000;
const double eps = 1e-8, pi = acos(-1);
int n, k;
double A[kN];
int tag[kN << 1];
int main() {
	multiCase() {
		n = in(), k = in();
		_rep(i,1,n) {
			int x = in(), y = in();
			A[i] = atan2(y, x);
		}
		sort(A + 1, A + 1 + n);
		double L = 0, R = pi, ans = 0;
		while(R - L > eps) {
			vector<double> a1, ra1, a2, ra2;
			_rep(i,1,n) {
				if(A[i] - mid >= -pi) a1.emplace_back(A[i] - mid);
				else ra1.emplace_back(pi - (-pi - (A[i] - mid)));
				if(A[i] + mid <= pi) a2.emplace_back(A[i] + mid);
				else ra2.emplace_back(-pi + (A[i] + mid - pi));
			}
			reverse(ra1.begin(), ra1.end());
			a1.insert(a1.end(), ra1.begin(), ra1.end()); 
			ra2.insert(ra2.end(), a2.begin(), a2.end()); 
			vector<double> d(a1.size() + ra2.size());
			merge(a1.begin(), a1.end(), ra2.begin(), ra2.end(), d.begin());
			d.insert(d.begin(), -pi), d.emplace_back(pi);
			d.erase(unique(d.begin(), d.end()), d.end());
			auto locate = [&](double x) { return lower_bound(d.begin(), d.end(), x) - d.begin(); };
			int mn = n, cur = 0;
			_rep(i,1,n) {
				if(A[i] - mid >= -pi) tag[locate(A[i] - mid)]++;
				else tag[0]++, tag[locate(pi - (-pi - (A[i] - mid)))]++;
				if(A[i] + mid <= pi) tag[locate(A[i] + mid)]--;
				else tag[0]++, tag[locate(-pi + (A[i] + mid - pi))]--;
			}
			int m = d.size();
			_rep(i,0,m - 2) {
				cur += tag[i]; chkmin(mn, cur);
			}
			_rep(i,0,m) tag[i] = 0;
			if(mn >= k) R = mid; else L = mid;
		}
		printf("%.10lf\n", L * 2);
	}
	return 0;
}