#include<stdio.h>
#include<limits.h>
#define MAX_NODES 100
#define INF INT_MAX
int min_distance(int dist[],int visited[],int n){
    int min_dist=INF;
    int min_index=-1;
    for(int v=0;v<n;v++){
    if(visited[v]==0&&dist[v]<=min_dist){
        min_dist=dist[v];
        min_index=v;
    }
}
    return min_index;
}
void dijkstrea(int n,int matrix[MAX_NODES][MAX_NODES],int start_node)
{
    int dist[MAX_NODES];
    int visited[MAX_NODES];
    for(int i=0;i<n;i++){
        dist[i]=INF;
        visited[i]=0;
    }
    dist[start_node]=0;
    for(int count=0;count<n-1;count++)
    {
        int u=min_distance(dist,visited,n);
        if(u==-1){
            break;
        }
        visited[u]=1;
        for(int v=0;v<n;v++)
        {
            if(!visited[v]&&matrix[u][v]>0&&dist[u]!=INF&&(long long)dist[u]+matrix[u][v]<dist[v])
            {
                dist[v]=dist[u]+matrix[u][v];
            }
        }
    }
    for(int i=0;i<n;i++){
        printf("%d",dist[i]);
    }
    printf("\n");
    }
    int main()
    {
        int n;
        int s;
        int matrix[MAX_NODES][MAX_NODES];
        int invalid_input=0;
        if(scanf("%d",&n)!=1){
            printf("Invalid input\n");
            return 0;
        }
        if(n<0||n>MAX_NODES){
            printf("Invalid input\n");
            return 0;
        }
        if(n>0){
            for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                if(scanf("%d",&matrix[i][j])!=1){
                    invalid_input=1;
                    break;
                }
                if(matrix[i][j]<0){
                    invalid_input=1;
                }
            }
            if(invalid_input)
            break;
        }
        if(matrix[i][j]<0){
            invalid_input=1;
        }
    }
    if(invalid_input)
    break;
}
   if(!invalid_input && scanf("%d",&s)!=1){
    invalid_input=1;
}
if(!invalid_input&&(s<0||s>=n)){
    invalid_input=1;
}
}
if(invalid_input){
    printf("Invaild input\n");
    rturn 0;
}
if(n>0){
    dijkstra(n,matrix,s);
}
else
{
    printf("\n");
}
return 0;
}