#include <fstream>
#include <vector>
#include <queue>
#include <algorithm>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
const int NMAX=100000;
vector <int> G[NMAX+5];
vector <bool> viz;
vector <int> d;
void bfs(int u)
{
    queue <int> q;
    q.push(u);
    int v,i;///vecin
    while(!q.empty())
    {
        u=q.front();
        q.pop();
        for(i=0;i<G[u].size();i++)
            {
                v=G[u][i];
                if(!viz[v])
                    {
                        d[v]=d[u]+1;
                        viz[v]=1;
                        q.push(v);
                    }
            }
    }
}
int main()
{
    int n,m,u,v,i,cc,j,s;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
        {
            fin>>u>>v;
            if(u!=v)
            G[u].push_back(v);

        }
        viz.assign(n+1,0);
        d.assign(n+1,0);
        bfs(s);
        d[s]=0;
        for(i=1;i<=n;i++)
            {
                if(i!=s && d[i]==0)
                    d[i]=-1;
                fout<<d[i]<<" ";
            }
        return 0;
}