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

using namespace std;

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

int n,m,s,dist[100001];

bool viz[100001];

vector<int>a[100001];

void bfs(int src)
{

    queue<int>q;
    q.push(src);

    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i=0;i<a[nod].size();++i)
        {

            if(!viz[a[nod][i]])
            {
                viz[a[nod][i]]=true;
                q.push(a[nod][i]);
                dist[a[nod][i]]=dist[nod]+1;

            }

        }

    }

}

int main()
{
    f>>n>>m>>s;
    viz[s]=true;
    for(int i=1;i<=m;++i)
    {

        int x,y;
        f>>x>>y;
        if(x!=y)a[x].push_back(y);

    }
    bfs(s);
    for(int i=1;i<s;++i)
    {

        if(!dist[i])
        {
            g<<"-1 ";
        }
        else
        {

            g<<dist[i]<<" ";

        }

    }
    g<<"0 ";
    for(int i=s+1;i<=n;++i)
    {

        if(!dist[i])
        {
            g<<"-1 ";
        }
        else
        {

            g<<dist[i]<<" ";

        }

    }
    return 0;
}