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

using namespace std;
const int MaxN=100005;
vector <int> v[MaxN];
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int s,n,m,i,x,y,viz[MaxN],k;
queue<int> q;


void bfs(int nod, int k){
    viz[nod]=k;
    q.push(nod);
    while(!q.empty()){
        nod=q.front();
        q.pop();
        for(i=0;i<v[nod].size();++i){
            if(!viz[v[nod][i]]){
                viz[v[nod][i]]=viz[nod]+1;

                q.push(v[nod][i]);
            }
        }
    }

}

void dfs(int nod)
{
    if(!viz[nod]){
        viz[nod]=k;
        for(int i=0;i<v[nod].size();++i)
        {
            if(!viz[v[nod][i]])
            {
                dfs(v[nod][i]);
            }
        }
    }
}

int main()
{

    fin>>n>>m>>s;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        v[x].push_back(y);
        //v[y].push_back(x);
    }


    bfs(s,1);

    /*
    k=0;
    for(register int i=1;i<=n;++i)
    {
        if(!viz[i]){
            k++;
            dfs(i);
        }
    }
    */
    //fout<<k;

    for(i=1;i<=n;++i){
        fout<<viz[i]-1<<" ";
    }
    fin.close();
    fout.close();
return 0;
}