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

using namespace std;

ifstream fin("dfs.in");
ofstream fout("dfs.out");

#define NMAX 100005

vector<int>v[NMAX];
queue<int> q;
bitset<NMAX>viz;
int rez[NMAX];

int n,m,x,y,k,s;

void bfs(int s)
{
    for(int i=1; i<=n; i++)
        rez[i]=-1;

    q.push(s);
    rez[s]=0;
    viz[s]=1;
    while(!q.empty())
    {
        int z = q.front();
        q.pop();

        for(int i=0; i<v[z].size(); i++)
            if(!viz[v[z][i]])
            {
                viz[v[z][i]]=1;
                rez[v[z][i]]=rez[z]+1;
                q.push(v[z][i]);
            }
    }

    rez[s]=0;
}

int main()
{
    fin>>n>>m>>s;

    for(int i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }

    bfs(s);

    for(int i=1; i<=n; i++)
        fout<<rez[i]<<" ";

    return 0;
}