/*#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=10010;
const int maxm=5*1e5+10;
// n-ans,m-ans,n+m-ans;
// 二分图匹配,骗分;
struct node{
int dis,cur;
}s[maxn];
int head[2*maxn],cnt,v[2*maxn],w[2*maxn],nxt[2*maxn],t,vis[maxn],cur
,d[maxn];
priority_queue<node> q;
bool operator < (node a,node b){
return a.dis>b.dis;
}
void add(int x,int y,int z){
++cnt; v[cnt]=y; w[cnt]=z; nxt[cnt]=head[x]; head[x]=cnt;
}
inline int read(){
int num=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') num=num*10+ch-'0',ch=getchar();
return f*num;
}
int main(){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
int u,vv,ww;
for(int i=1;i<=m;i++){
u=read(),vv=read(),ww=read();
add(u,vv,ww);
}
for(int i=1;i<=n;i++){
memset(vis,0,sizeof(vis));
memset(d,0x7f,sizeof(d));
node now; now.cur=s; now.dis=0; d[s]=0;
q.push(now);
while(!q.empty()){
node x=q.top(); q.pop();
int xx=x.cur;
if(vis[xx]) continue;
vis[xx]=true;
for(int i=head[xx];i;i=nxt[i]){
int v1=v[i];
if(!vis[v1]&&d[v1]>d[xx]+w[i]){
d[v[i]]=d[xx]+w[i];
node y; y.cur=v[i]; y.dis=d[v[i]];
q.push(y);
}
}
}
printf("%d ",d[i]);
}
return 0;
}*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=10010;
const int maxm=5*1e5+10;
int head[2*maxm],cnt,v[2*maxm],w[2*maxm],nxt[2*maxm],t,vis[maxn],cur
,dis[maxn],l,r,q[maxn];
inline int read(){
int num=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') num=num*10+ch-'0',ch=getchar();
return f*num;
}
void add(int x,int y,int z){
++cnt; v[cnt]=y; w[cnt]=z; nxt[cnt]=head[x]; head[x]=cnt;
}
int main(){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
int u,vv,ww;
for(int i=1;i<=m;i++){
u=read(),vv=read(),ww=read();
add(u,vv,ww);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
vis[i]=false;
}
for(int j=1;j<=n;j++) dis[j]=200000000;
l=r=0;
dis[s]=0; vis[s]=true; q[++r]=s;
while(l<r){
int now=q[++l];
for(int j=head[now];j;j=nxt[j]){
if(dis[now]+w[j]<dis[v[j]]){
dis[v[j]]=dis[now]+w[j];
if(!vis[v[j]]){
vis[v[j]]=true;
q[++r]=v[j];
}
}
}
vis[now]=false;
}
printf("%d ",dis[i]);
}
return 0;
}
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=10010;
const int maxm=5*1e5+10;
// n-ans,m-ans,n+m-ans;
// 二分图匹配,骗分;
struct node{
int dis,cur;
}s[maxn];
int head[2*maxn],cnt,v[2*maxn],w[2*maxn],nxt[2*maxn],t,vis[maxn],cur
,d[maxn];
priority_queue<node> q;
bool operator < (node a,node b){
return a.dis>b.dis;
}
void add(int x,int y,int z){
++cnt; v[cnt]=y; w[cnt]=z; nxt[cnt]=head[x]; head[x]=cnt;
}
inline int read(){
int num=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') num=num*10+ch-'0',ch=getchar();
return f*num;
}
int main(){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
int u,vv,ww;
for(int i=1;i<=m;i++){
u=read(),vv=read(),ww=read();
add(u,vv,ww);
}
for(int i=1;i<=n;i++){
memset(vis,0,sizeof(vis));
memset(d,0x7f,sizeof(d));
node now; now.cur=s; now.dis=0; d[s]=0;
q.push(now);
while(!q.empty()){
node x=q.top(); q.pop();
int xx=x.cur;
if(vis[xx]) continue;
vis[xx]=true;
for(int i=head[xx];i;i=nxt[i]){
int v1=v[i];
if(!vis[v1]&&d[v1]>d[xx]+w[i]){
d[v[i]]=d[xx]+w[i];
node y; y.cur=v[i]; y.dis=d[v[i]];
q.push(y);
}
}
}
printf("%d ",d[i]);
}
return 0;
}*/
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
using namespace std;
const int maxn=10010;
const int maxm=5*1e5+10;
int head[2*maxm],cnt,v[2*maxm],w[2*maxm],nxt[2*maxm],t,vis[maxn],cur
,dis[maxn],l,r,q[maxn];
inline int read(){
int num=0,f=1; char ch=getchar();
while(ch<'0'||ch>'9'){
if(ch=='-') f=-1;
ch=getchar();
}
while(ch>='0'&&ch<='9') num=num*10+ch-'0',ch=getchar();
return f*num;
}
void add(int x,int y,int z){
++cnt; v[cnt]=y; w[cnt]=z; nxt[cnt]=head[x]; head[x]=cnt;
}
int main(){
int n,m,s;
scanf("%d%d%d",&n,&m,&s);
int u,vv,ww;
for(int i=1;i<=m;i++){
u=read(),vv=read(),ww=read();
add(u,vv,ww);
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
vis[i]=false;
}
for(int j=1;j<=n;j++) dis[j]=200000000;
l=r=0;
dis[s]=0; vis[s]=true; q[++r]=s;
while(l<r){
int now=q[++l];
for(int j=head[now];j;j=nxt[j]){
if(dis[now]+w[j]<dis[v[j]]){
dis[v[j]]=dis[now]+w[j];
if(!vis[v[j]]){
vis[v[j]]=true;
q[++r]=v[j];
}
}
}
vis[now]=false;
}
printf("%d ",dis[i]);
}
return 0;
}