#include <bits/stdc++.h>
#define NMAX 100100
#define MMAX 1000100

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> v[NMAX];
bool viz[NMAX];
int n, m, s;
int sol[MMAX];

void bfs (int node){
    int i, newnode;
    queue <int> q;
    q.push(node);
    viz[node]=true;
    while(!q.empty()){
        newnode=q.front();
        q.pop();
        for(i=0; i<v[newnode].size(); i++){
            int lastnode=v[newnode][i];
            cout<<newnode<<" "<<lastnode<<" "<<v[newnode].size()<<"\n";
            if (viz[lastnode]==false){
                viz[lastnode]=true;
                sol[lastnode]=sol[newnode]+1;
                q.push(lastnode);
            }
        }
    }
}

int main()
{
    int i, j, x, y;
    f>>n>>m>>s;
    for (i=1; i<=m; i++){
        f>>x>>y;
        v[x].push_back(y);
    }
    sol[s]=0;
    viz[s]=1;
    bfs(s);
    for(i=1; i<=n; i++){
        if(viz[i]==0) g<<"-1 ";
        else g<<sol[i]<<" ";
    }
    return 0;
}