#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int viz[100001],n,m,s;
vector<int> G[100001];
queue<int> q;
void bfs(int x)
{
    q.push(x);
    while(!q.empty())
    {
        int xc=q.front();
        for(vector<int>::iterator it=G[xc].begin();it!=G[xc].end();it++)
        {
            int nod=*it;
            if(viz[nod]==0 && nod!=x)
            {
                viz[nod]=viz[xc]+1;
                q.push(nod);
            }
        }
        q.pop();
    }
}
int main()
{
	fin >> n >> m >> s;
	for(int i=1;i<=m;i++)
    {
        int x,y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    bfs(s);
    for(int i=1;i<=n;i++)
    {
        if(viz[i]!=0 || i==s) fout << viz[i] << " ";
        if(viz[i]==0 && i!=s) fout << "-1 ";
	}
	return 0;
}