#include <fstream>
#include <vector>
#include <queue>
#define nmax 10001

using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");

struct nod
{
    int nr_v=0;
    int vec[nmax];
};
int n,m,x;
nod v[nmax];

int dist[nmax];
int d;
int viz[nmax];

void read()
{
    fin>>n>>m>>x;
    int val1,val2,i;
    for(i=1; i<=m; i++)
       {
           fin>>val1>>val2;
           int ct=v[val1].nr_v;
           v[val1].vec[ct]=val2;
           v[val1].nr_v++;
       }
}

void bfs(int x)
{
    int i;
    queue<int>C;
    C.push(x);
    viz[x]=1;
    while(!C.empty())
         {
             int node=C.front();
             C.pop();
             int ct=v[node].nr_v;
             viz[node]=1;
             for(i=0; i<ct; i++)
                 {
                   int val=v[node].vec[i];
                   if(viz[val]==0) {dist[val]=dist[node]+1; C.push(val);}
                 }
         }
}

int main()
{
    read();
    for(int i=1; i<=n; i++)
         dist[i]=n;
    dist[x]=0;
    bfs(x);
    for(int i=1; i<=n; i++)
         if(dist[i]!=n) fout<<dist[i]<<" ";
         else if(i==x) fout<<0<<" ";
              else fout<<-1<<" ";

    return 0;
}