#include <fstream>
#define INF 10000
using namespace std;

ifstream fin("graf.in");
ofstream fout("graf.out");

int n, start;
int cmin[100], c[100][100];
int tata[100];

void citire();
void afisare();
int bellman_ford(int start);
void drum(int x);

int main()
{
    citire();
    afisare();
    return 0;
}

void citire()
{
    int i, m, x, y, cost, j;
    fin>>n>>m>>start;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(i!=j)
                c[i][j]=INF;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y>>cost;
        c[x][y]=cost;
    }
}

void afisare()
{
    int i, x;
    x=bellman_ford(start);
    if(x==1) fout<<"Nu exista drum minim"<<'\n';
    else
        for(i=1;i<=n;i++)
        {
            fout<<"Costul pana la vf "<<i<<" este:"<<cmin[i]<<" iar drumul este: ";
            drum(tata[i]);
            fout<<i<<'\n';
        }
}

void drum(int x)
{
    if(x==0) return;
    drum(tata[x]);
    fout<<x<<' ';
}

int bellman_ford(int start)
{
    int i, j, x, schimb;
    for(i=1;i<=n;i++)
        cmin[i]=INF;
    cmin[start]=0;
    for(i=1;i<=n;i++)
    {
        schimb=0;
        for(j=1;j<=n;j++)
            for(x=1;x<=n;x++)
            if (cmin[j]!=INF&&c[j][x]!=INF)
               if(cmin[x]>cmin[j]+c[j][x])
               {
                  cmin[x]=cmin[j]+c[j][x];
                  tata[x]=j; schimb=1;
               }
   }
   return schimb;
}