#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[100005];
queue <int> q;
int n,m,s,x,y,S[100005];
int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    q.push(s);
    S[s]=1;
    while(!q.empty())
    {
        int nr=q.front();
        q.pop();
        for(vector <int> :: iterator it=v[nr].begin();it<v[nr].end();it++)
        {
            int nr2=*it;
            if(S[nr2]!=0)
            {
                if(S[nr]+1<S[nr2])
                {S[nr2]=S[nr]+1;
                q.push(nr2);}
            }
            else {S[nr2]=S[nr]+1;
            q.push(nr2);
            }
        }
    }
    for(int i=1;i<=n;i++)
        fout<<S[i]-1<<" ";
    return 0;
}