#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,nod,d[nmax];
bool viz[nmax];
vector<int>L[nmax];
queue<int>c;
void Read()
{
    int i,x,y;
    fin>>n>>m>>nod;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
}
void Solve()
{
    int i,x,y;
    c.push(nod);
    for(i=1;i<=n;i++)
        d[i]=-1;
    d[nod]=0;
    viz[nod]=true;
    while(!c.empty())
    {
        x=c.front();
        c.pop();
        for(i=0;i<L[x].size();i++)
        {
            y=L[x][i];
            if(!viz[y])
            {
                viz[y]=true;
                d[y]=d[x]+1;
                c.push(y);
            }
        }
    }
    for(i=1;i<=n;i++)
        fout<<d[i]<<" ";
    fout<<"\n";
}
int main()
{
    Read();
    Solve();
    fin.close();
    fout.close();
    return 0;
}