玄关求调

#include <bits/stdc++.h>
using namespace std;
const int N = 1e5+5;
int n, d, s[N], t[N], h[N], ST;
int main() {
	cin >> n >> d;
	for(int i=1; i<=n+1; i++)
		cin >> s[i] >> t[i] >> h[i];
	ST = t[1]-s[1];
	for(int i=2; i<=n+1; i++) {
		if(abs(h[i]-h[1])>d) {
			cout << "No\n";
			continue;
		}
		double k = abs(t[i]-s[i])*1.0/ST;
		if(t[i]-s[i]<0) k = -k;
		if(k==1&&s[i]==s[1]) {
			cout << "Always\n";
			continue;
		}
		if(k==1&&s[i]!=s[1]) {
			cout << "No\n";
			continue;
		}
		double x = (s[1]-s[i])*1.0/(k-1);
		if(x<0||x>ST) cout << "No\n";
		else printf("%.12f\n", x);
	} 
	return 0;
}