#include <fstream>
#include <bitset>
#include <vector>
#include <queue>
#define N 100003

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

bitset<N> f;
vector<int> g[N];
int n,m,s;
int dist[N];
queue<int> q;

int x,y;

int main()
{
    fin>>n>>m>>s;
    while(m--)
    {
        fin>>x>>y;
        g[x].push_back(y);
    }

    q.push(s);
    f[s] = 1;
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();

        for(auto i :g[nod])
            if(!f[i])
            {
                f[i] = 1;
                dist[i] = dist[nod] + 1;
                q.push(i);
            }
    }

    for(int i=1; i<=n; ++i)
        if(dist[i] == 0) dist[i] = -1;
    dist[s] = 0;

    for(int i=1; i<=n; ++i)
        fout<<dist[i]<<" ";

    return 0;
}