#include<iostream>
#include<fstream>
#include<vector>
#include<bitset>
#include<deque>
#define dim 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> L[dim];
bitset <dim> fr;
int d[dim];
int n,m,start,x,y;
void bfs (int start)
{
    fr[start]=1;
    deque <int> q;
    q.push_back(start);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop_front();
        for(int i=0;i<L[nod].size();++i)
        {
            int vefin = L[nod][i];
            if(fr[vefin]==0)
            {
                d[vefin]=d[nod]+1;
                q.push_back(vefin);
                fr[vefin]=1;
            }
        }

    }

}
int main()
{
    fin>>n>>m>>start;
    for(int i=1;i<=m;++i)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    bfs(start);
    for(int i=1;i<=n;++i)
    {
        if(fr[i])fout<<d[i]<<" ";
        else fout<<-1<<" ";
    }
}