#include <bits/stdc++.h>
#define T long double

using namespace std;

void solve() {
    int n, v; cin >> n >> v;
    vector<pair<T, T>> h(n);
    for(auto& [a, b] : h) {
        long long x, y; cin >> x >> y;
        a = x, b = y;
    }
    T lo = 0, hi = 1e18;
    const T oo = 1e18;
    for(int r = 0; r < 120; r++) {
        T mid = (lo + hi) / 2;
        T najd = -oo * oo;
        T najbl = oo * oo;
        for(int i = 0; i < n; i++) {
            if(h[i].first < 0) najd = max(najd, h[i].first + h[i].second * mid);
            else najbl = min(najbl, h[i].first - h[i].second * mid);
        }
        if(najbl < najd) {
            hi = mid;
        }
        else {
            lo = mid;
        }
    }
    cout << v * hi << '\n';
}

int32_t main() {
    cin.tie(0)->sync_with_stdio(0);
    cout << fixed << setprecision(20);
    int t; cin >> t;
    while(t--) solve();
}