#include<iostream>
#include<cstring>
#include<vector>
#include<algorithm>
#include<cmath>
#include<iomanip>
using namespace std;
using LL = long long;
const double pi = acos(-1); 

struct Point{
    LL x, y;

    double angle(){
        return atan2(y, x);
    }

    LL operator^(const Point &t) const {
        return x * t.y - y * t.x;
    }

    LL operator*(const Point &t) const {
        return x * t.x + y * t.y;
    }

    int quad() const {
        if (y < 0) return 1;
        if (y > 0) return 3;
        if (x > 0) return 2;
        return 4;
    };

    bool operator<(const Point &t) const {
        int q1 = quad(), q2 = t.quad();
        if (q1 != q2) return q1 < q2;
        return (*this ^ t) > 0;
    }

    bool operator==(const Point &t) const {
        int q1 = quad(), q2 = t.quad();
        return q1 == q2 and (*this ^ t) == 0;
    }

    double len(){
        return sqrtl(x * x + y * y);
    }

};

double a(Point a, Point b){
    double alpha = acos(a * b / a.len() / b.len());
    if ((a ^ b) >= 0) return alpha;
    return 2 * pi - alpha;
}

int main(){

#ifdef LOCAL
    freopen("data.in", "r", stdin);
    freopen("data.out", "w", stdout);
#endif

    cin.tie(0);
    cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(10);

    int T;
    cin >> T;
    while(T--){
        int n, k;
        cin >> n >> k;
        vector<Point> p(n);
        for(int i = 0; i < n; i++){
            cin >> p[i].x >> p[i].y;
        }
        sort(p.begin(), p.end());
        double ans = 0;
        for(int i = 0; i < n; i++){
            while(i < n and p[i] == p[i + 1]) i++;
            if (p[i] == p[(i + k) % n]){
                ans = pi * 2;
            }
            else{
                ans = max(ans, a(p[i], p[(i + k) % n]));
            }
        }
        cout << ans << '\n';
    }

}