#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
vector <int> adj[10001];
int q[10001],viz[10001],d[10001],s,n,m,i;
void bfs(int nod)
{
    int st=1,dr=1;
    q[1] = s;
    d[s] = 1;
    while(dr-st+1>0)
    {
        nod = q[st];
        st++;
        for(int i = 0; i < adj[nod].size(); i++)
        {
            if(d[adj[nod][i]] == 0 || d[adj[nod][i]]>d[nod]+1)
            {
                d[adj[nod][i]]=d[nod]+1;
                dr++;
                q[dr]=adj[nod][i];
            }
        }
    }
}
int main()
{

    fin>>n>>m>>s;
    for (i=0; i<m; ++i)
    {
        int a,b;
        fin>>a>>b;
        adj[a].push_back(b);
    }
    bfs(s);
    for (i=1; i<=n; ++i)
    {
        fout<<d[i]-1<<" ";
    }
}