#include <iostream>
#include <vector>
#include <queue>
#include <fstream>

using namespace std;

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

const int NMAX = 1e6+1;

vector <int> v[NMAX];
queue <int> Q;
int f[NMAX+1];
int sol[NMAX];

int main()
{
    int n,m,s;
    in>>n>>m>>s;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        in>>x>>y;
        v[x].push_back(y);
    }
    Q.push(s);
    f[s]=1;
    sol[s]=1;
    while(Q.empty()==0)
    {
        int k;
        k=Q.front();
        Q.pop();
        f[k]++;
        int p;
        p=v[k].size();
        for(int i=0; i<p; i++)
        {
            int node = v[k][i];
            if(f[node]==0)
            {
                sol[node]=sol[k]+1;
                Q.push(node);
            }

        }
    }
    for(int i=1;i<=n;i++)
        out<<sol[i]-1<<" ";
}