#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#define Inf 20000

using namespace std;

int n, x0;
vector< vector<double> > c;
vector< double > d;
vector< int > pre, m;

void Initializare()
{
    int i, j, q, x, y;
    double p;
    ifstream f("date.in");
    f>>n>>q>>x0;

    c.resize(n+1, vector<double>(n+1));
    d.resize(n+1);
    pre.resize(n+1);
    m.resize(n+1);

    for(i=1;i<=n;i++)
        for(j=i+1;j<=n;j++)
        {
            c[i][j]=Inf;
            c[j][i]=Inf;
        }
    for(i=1;i<=q;i++)
    {
        f>>x>>y>>p;
        c[x][y]=p;
    }
    for(i=1;i<=n;i++)
    {
        d[i]=c[x0][i];
        pre[i]=x0;
    }
    m[x0]=1;
    pre[x0]=0;
    f.close();
}
void Afisare()
{
    int i, j, lg;
    vector <int> dr;
    dr.resize(n+1);
    for(i=1;i<=n;i++)
        if(i!=x0)
        {
            cout<<"Costul drumului de cost minim de la "<<x0<<" la "<<i<<" este "<<d[i]<<endl;
            cout<<"Drumul de cost minim:";
            dr[0]=i;
            lg=0;
            while(pre[dr[lg]])
            {
                lg++;
                dr[lg]=pre[dr[lg-1]];
            }
            for(j=lg;j>=0;j--)
                cout<<' '<<dr[j];
            cout<<endl;
        }
}
int main()
{
    int i, Vfmin, j;
    double dMin;
    Initializare();
    for(j=1;j<n;j++)
    {
        dMin = Inf;
        for(i=1;i<=n;i++)
            if(!m[i] && dMin>d[i])
            {
                dMin = d[i];
                Vfmin=i;
            }
        m[Vfmin]=1;
        for(i=1;i<=n;i++)
            if(!m[i] && d[i] > dMin + c[Vfmin][i])
            {
                pre[i]=Vfmin;
                d[i]=dMin + c[Vfmin][i];
            }
    }
    Afisare();
    return 0;
}