#include<iostream>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<queue>
using namespace std;
#define debug(x) cout<<#x<<" "<<(x)<<endl
#define debug2(x,y) cout<<#x<<endl;for(int i=1;i<=y;++i)cout<<x[i]<<" ";cout<<endl
#define mem(x,y) memset(x,y,sizeof(x));
#define int long long
#define double long double
const int inf=0x3f3f3f3f3f3f3f3f;
const double eps=1e-9;
const double PI=acos(-1.0);
const int maxn=1e6+10;struct Edge
{int to,w,flg;bool operator<(const Edge &edge)const{return w>edge.w;}
};int n,m,s,k;
vector<Edge> edg[maxn];
bool vis[maxn][2];
int dis[maxn][2];
int dfn[maxn];void dijkstra()
{mem(vis,0);mem(dis,0x3f);mem(dfn,0);set<int> ss;for(int i=1;i<=n;++i)if(i!=s)ss.insert(i);priority_queue<Edge> q;dis[s][0]=0;q.push({s,0,0});int tot=0;while(!q.empty()){int fr=q.top().to,flg=q.top().flg;q.pop();if(vis[fr][flg])continue;vis[fr][flg]=1;ss.erase(fr);++tot;if(flg){for(auto it:edg[fr])dfn[it.to]=tot;vector<int> t;for(int it:ss){if(dfn[it]==tot)continue;dis[it][0]=dis[fr][1];q.push({it,dis[it][0],0});t.push_back(it);}for(int it:t)ss.erase(it);}int t=0;if(flg)t=k;for(auto it:edg[fr]){if(dis[it.to][it.flg]<dis[fr][flg]+it.w-t)continue;dis[it.to][it.flg]=dis[fr][flg]+it.w-t;q.push({it.to,dis[it.to][it.flg],it.flg});}}
}signed main()
{ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);// cout<<fixed<<setprecision(6);int _;cin>>_;while(_--){cin>>n>>m>>s>>k;for(int i=1;i<=n;++i)edg[i].clear();int fr,to,w,flg;for(int i=1;i<=m;++i){cin>>fr>>to>>w>>flg;edg[fr].push_back({to,w,flg});}dijkstra();for(int i=1;i<=n;++i){int t=min(dis[i][0],dis[i][1]);if(t!=dis[0][0])cout<<t<<" ";else cout<<-1<<" ";}cout<<'\n';}return 0;
}

#include<iostream>
using namespace std;
const int maxn=1e6+10;int n;
int x[maxn],y[maxn];bool check(int xx,int yy)
{for(int i=1;i<=n;++i){if(xx==x[i]||yy==y[i]||xx-yy==x[i]-y[i]||xx+yy==x[i]+y[i])continue;return 0;}return 1;
}bool big_check(int x1,int y1,int x2,int y2)
{int b1,b2;if(check(x2,y1))return 1;if(check(x2-(y1-y2),y1))return 1;if(check(x2+(y1-y2),y1))return 1;if(check(x1,y2))return 1;if(check(x1,y2-(x2-x1)))return 1;if(check(x1,y2+(x2-x1)))return 1;b1=y1-x1;if(check(y2-b1,y2))return 1;if(check(x2,x2+b1))return 1;b2=y2+x2;if(check((b2-b1)/2,(b1+b2)/2))return 1;b1=y1+x1;if(check(-y2+b1,y2))return 1;if(check(x2,-x2+b1))return 1;b2=y2-x2;if(check((b1-b2)/2,(b1+b2)/2))return 1;return 0;
}bool solve()
{if(n<=2)return 1;if(big_check(x[1],y[1],x[2],y[2]))return 1;int x1=x[1],y1=y[1],x2=x[2],y2=y[2];if(x1==x2){int t=-1;for(int i=3;i<=n;++i)if(x[i]!=x1)t=i;if(t==-1)return 1;else if(big_check(x1,y1,x[t],y[t]))return 1;}if(y1==y2){int t=-1;for(int i=3;i<=n;++i)if(y[i]!=y1)t=i;if(t==-1)return 1;else if(big_check(x1,y1,x[t],y[t]))return 1;}if(y1+x1==y2+x2){int t=-1;for(int i=3;i<=n;++i)if(y[i]+x[i]!=y1+x1)t=i;if(t==-1)return 1;else if(big_check(x1,y1,x[t],y[t]))return 1;}if(y1-x1==y2-x2){int t=-1;for(int i=3;i<=n;++i)if(y[i]-x[i]!=y1-x1)t=i;if(t==-1)return 1;else if(big_check(x1,y1,x[t],y[t]))return 1;}return 0;
}int main()
{ios::sync_with_stdio(0);cin.tie(0);int _;cin>>_;while(_--){cin>>n;for(int i=1;i<=n;++i){cin>>x[i]>>y[i];x[i]*=2;y[i]*=2;}if(solve())cout<<"YES\n";else cout<<"NO\n";}return 0;
}

#include<iostream>
#include<cstring>
using namespace std;
#define int long long
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define mem(x,y) memset(x,y,sizeof(x))
const int inf=0x3f3f3f3f3f3f3f3f;
const int mod=1e9+7;int bitpow(int x,int y)
{int res=1;while(y){if(y&1)res=res*x%mod;x=x*x%mod;y>>=1;}return res;
}signed main()
{ios::sync_with_stdio(0);cin.tie(0);int _;cin>>_;int inv2=bitpow(2,mod-2);while(_--){int x,y;cin>>x>>y;cout<<(x-y+mod)*inv2%mod<<'\n';}return 0;
}

#include<iostream>
using namespace std;
#define int long long
const int maxn=1e6+10;int n;
int a[maxn];signed main()
{ios::sync_with_stdio(0);cin.tie(0);int _;cin>>_;while(_--){cin>>n;for(int i=0;i<=n;++i)cin>>a[i];bool flg=0;for(int i=n;i>=0;--i){if(a[i]>>i){flg=1;break;}if(i)a[i-1]+=a[i]/2;}if(flg)cout<<"Alice\n";else cout<<"Bob\n";}return 0;
}