#include <fstream>
#include <bitset>
#include <vector>
#include <deque>
using namespace std;
const int nmax=100001;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> x[nmax];
vector <int>::iterator it;
int v[nmax];
bitset<nmax> viz;
struct nr
{
    int pr,cost;
};
deque<nr>stack;
int main()
{
    int n,m,s,i,k,y,r=1;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>k>>y;
        x[k].push_back(y);
    }
    nr pas;
    pas.pr=s;pas.cost=0;
    stack.push_back(pas);
    while(stack.size()&&r<m)
    {
        for(it=x[stack.front().pr].begin();it!=x[stack.front().pr].end();it++)
        {
            if(viz[*it]==0&&*it!=s)
            {
                pas.pr=*it;
                pas.cost=stack.front().cost+1;
                stack.push_back(pas);
                viz[*it]==1;
            if(pas.cost<v[*it]||v[*it]==0) v[*it]=stack.front().cost+1;
                r++;
            }
        }
        stack.pop_front();
    }
    for(i=1;i<=n;i++)
    {
        if(v[i]==0&&i!=s) fout<<-1<<" ";
        else if(i==s) fout<<0<<" ";
        else fout<<v[i]<<" ";
    }
}