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

using namespace std;

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

int n,m,i,j,dis[100010],x,y,s,ElChapo=2e9;
bool viz[10010];
vector<int> l[100010];
queue<int> qu;

void le_bfs()
{
    int nod=s;
    qu.push(nod);
    nod =0;

    while(qu.size()>0)
    {
        nod=qu.front();
        qu.pop();
        //fout<<nod;
        viz[nod]=1;

        for(int i=0;i<l[nod].size();++i)
        {
            if(viz[ l[nod][i] ]==0 )
            {
                qu.push(l[nod][i]);
                dis[ l[nod][i] ]=dis[nod]+1;
            }
        }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;++i)
    {
        fin>>x>>y;
        l[x].push_back(y);
    }
    for(i=1;i<=n;++i)
        dis[i]=-1;
    dis[s]=0;

    le_bfs();

    for(i=1;i<=n;++i)
        fout<<dis[i]<<" ";

    return 0;

}