#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define f first
#define s second
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int N,M,poz[100010],viz[100010],rez[100010];
vector <int> v[100010];
queue < pair<int,int> > q;
void bfs(int nod)
{
    int i;
    rez[nod]=q.front().s;
    q.pop();
    for(i=0; i<v[nod].size(); i++)
    {
        if(viz[v[nod][i]]==0)
        {
            viz[v[nod][i]]=1;
            q.push(make_pair(v[nod][i],rez[nod]+1));
        }
    }
    if(!q.empty())
        bfs(q.front().f);
}
int main()
{
    int x,y,i,S;
    fin>>N>>M>>S;
    for(i=1; i<=M; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    for(i=1; i<=N; i++)
    {
        rez[i]=-1;
    }
    q.push(make_pair(S,0));
    viz[S]=1;
    bfs(q.front().f);
    for(i=1; i<=N; i++)
    {
        fout<<rez[i]<<" ";
    }

}