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

using namespace std;
ifstream r("bfs.in");
ofstream w("bfs.out");
vector<int>g[100002];
queue<int>q;
int v[1000];
int main()
{
    int n, m, s;
    r>>n>>m>>s;
    q.push(s);
    v[s]=1;
    for(int i=0; i<m; i++)
    {
        int x, y;
        r>>x>>y;
        g[x].push_back(y);
    }
    int cnt=1;

    while(q.size()!=0)
    {
        int x=q.front();
        for(int i=0;i<g[x].size();i++)
        {
            if(v[g[x][i]]==0)
            {
                q.push(g[x][i]);
                v[g[x][i]]=v[x]+1;
            }
        }
        q.pop();
    }
    for(int i=1; i<=n; i++)
    {
        if(v[i]==0)
        {
            w<<-1<<" ";
        }
        else
        {
            w<<v[i]-1<<" ";
        }
    }
    return 0;
}