#include <fstream>
#include <vector>
using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

long n,m,s,d,i,j,x,y,nod[100005],c[100005];
vector <int> v[100005];
int main()
{
    f>>n>>m>>s;
    for (i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        nod[i]=-2;
    c[1]=s;
    nod[s]=-1;
    d=1;
    int j=1;
    while (j<=d)
    {
         for (i=0;i<v[c[j]].size();i++)
            if (nod[v[c[j]][i]]==-2)
            {
                nod[v[c[j]][i]]=nod[c[j]]+1;
                d++;
                c[d]=v[c[j]][i];
            }
        j++;
    }
    for (i=1;i<=n;i++)
        g<<nod[i]+1<<' ';




    f.close();
    g.close();
    return 0;
}