#include <bits/stdc++.h>
using namespace std;

#define ll long long
const double pi = acos(-1);

struct Point{
	ll x, y;
    Point(){}
    Point(ll _x, ll _y){x = _x, y=_y;}
};
int operator^(const Point &a, const Point &b){
	return a.x * b.y - a.y * b.x;	
}
int quad(const Point &a){
	if(a.x > 0 && a.y == 0){
		return 1;
	}else if(a.x > 0 && a.y > 0){
		return 2;
	}else if(a.x == 0 && a.y > 0){
		return 3;
	}else if(a.x < 0 && a.y > 0){
		return 4;
	}else if(a.x < 0 && a.y == 0){
		return 5;
	}else if(a.x < 0 && a.y < 0){
		return 6;
	}else if(a.x == 0 && a.y < 0){
		return 7;
	}else if(a.x > 0 && a.y < 0){
		return 8;
	}
}

bool cmp(const Point &a, const Point &b){
	int qa = quad(a), qb = quad(b);
	if(qa != qb){
		return qa < qb;
	}else{
		return (a ^ b) >= 0;
	}
}

double fun(Point p) {
    auto [x, y] = p;
    if (x > 0) {
        if (y > 0) {
            return atan(1.0 * y / x);
        } else if (y == 0) {
            return 0;
        } else {
            return 2*pi - atan(1.0 * (-y)/x);
        }
    } else if (x == 0) {
        if (y > 0) {
            return pi/2;
        } else {
            return pi*3/2;
        }
    } else {
        if (y > 0) {
            return pi - atan(1.0 * y / (-x));
        } else if (y == 0) {
            return pi;
        } else {
            return pi + atan(1.0 * (-y) /(-x));
        }
    }
}

void solve() {
    int n, k;
    cin>>n>>k;
    vector<Point> a(2*n+1);
    for (int i = 1; i <= n; i++) {
        ll x, y;
        cin>>x>>y;
        a[i] = {x, y};
    }
    sort(a.begin()+1, a.begin()+n+1, cmp);
    for (int i = 1; i <= n; i++) {
        a[i+n] = a[i];
    }
    double ans = 0;
    for (int i = 1; i <= n; i++) {
        double l = fun(a[i]);
        double r = fun(a[i+k]);
        if (i+k > n) r += 2*pi;
        ans = max(ans, r-l);
    }
    cout<<fixed<<setprecision(20);
    cout<<ans<<'\n';
}

int main()
{
    if (ifstream("test.in")) {
        freopen("test.in", "r", stdin);
        freopen("test.out", "w", stdout);
    }
    ios::sync_with_stdio(false);
    cin.tie(0);
    int T = 1;
    cin>>T;
    while (T--) {
        solve();
    }
    return 0;
}