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

using namespace std;

int main()
{
    ifstream f("bfs.in");
    int y,s,n,m,a,b;
    f>>n>>m>>s;
    vector <int> vecini[n+1],viz,dist;
    queue <int> p;
    for (int i=0;i<m;i++)
    {
        f>>a>>b;
        if (a!=b) vecini[a].push_back(b);
    }
    viz.resize(n+1);
    dist.resize(n+1);
    for (int i=1;i<=n;i++) viz[i]=0;
    p.push(s);
    while (!p.empty())
    {
        y=p.front();
        p.pop();
        if (viz[y]==0)
        {
            viz[y]=1;
            for (int i=vecini[y].size()-1;i>=0;i--)
            {
                p.push(vecini[y][i]);
                if (viz[vecini[y][i]]==0) dist[vecini[y][i]]=dist[y]+1;
            }
        }
    }
    ofstream g("bfs.out");
    for (int i=1;i<=n;i++)
        if (dist[i]==0 && i==s) g<<"0 ";
            else if (dist[i]==0) g<<"-1 ";
                else g<<dist[i]<<" ";
    return 0;
}