#include<fstream>
#include<vector>
#include<queue>
using namespace std;

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

vector<int>a[100001];
queue<int>b;
int c[100001],el,N,M,S,x,y;

void bfs(int nod)
{
    c[nod]=1;
    b.push(nod);
    while(!b.empty())
            {
              el=b.front();
              b.pop();
              for(int i=0;i<a[el].size();++i)
                if(c[a[el][i]]==0)
                  {
                      c[a[el][i]]=c[el]+1;
                      b.push(a[el][i]);
                  }
            }
}


int main()
{
    fin>>N>>M>>S;
    for (int i=1;i<=M;++i)
    {
        fin>>x>>y;
        a[x].push_back(y);
    }
    bfs(S);
    for(int i=1;i<=N;++i)
        fout<<c[i]-1
        <<" ";

    return 0;
}