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

#define NMAX 100000

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

vector <int> v[NMAX],viz,res;
int n,m,s;

void bfs(int k,int nr)
{
    queue <pair<int,int>> t;
    viz[k]=1;
    res[k]=0;
    t.push(make_pair(k,0));
    pair <int,int> p=t.front();
    while(!t.empty())
    {
        t.pop();
        for(auto x:v[p.first])
            if(!viz[x])
        {
            viz[x]=1;
            res[x]=p.second+1;
            t.push(make_pair(x,res[x]));
        }
        p=t.front();
    }
}

int main()
{
    f>>n>>m>>s;
    for(int i=0;i<n;++i)
    {
        viz.push_back(0);
        res.push_back(-1);
    }
    for(int i=0;i<m;++i)
    {
        int x,y;
        f>>x>>y;
        v[x-1].push_back(y-1);
    }
    bfs(s-1,1);
    for(auto x:res)
        g<<x<<' ';
    return 0;
}