#include <fstream>
#include <vector>
#include <queue>

using namespace std;
const int NMAX=1e5 + 5;

int level[NMAX],n,m,s,i,x,y;
queue <int> q;
vector <int> a[NMAX];
bool check[NMAX];

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

void bfs(int node)
{
    int x;
    check[node]=true;
    level[node]=1;
    q.push(node);
    while(q.size())
    {
        x=q.front();

        for(auto &it : a[x])
        if(!check[it])
        {
            q.push(it);
            check[it]=true;
            level[it]=level[x]+1;
        }
        q.pop();
    }
}

int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++){
        f>>x>>y;
    a[x].push_back(y);
    }
    bfs(s);

    for(i=1;i<=n;i++)
        g<<level[i]-1<<' ';
    return 0;
}