#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream fin ("bfs.in");
ofstream fout ("bfs.out");
int n, m, s, dist[100005], viz[100005];
vector <int> la[100005];
queue <int> q;
void bfs()
{
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for (int i = 0; i < la[nod].size(); i++) {
            int vecin = la[nod][i];
            if (viz[vecin] == 0) {
                q.push(vecin);
                dist[vecin] = dist[nod] + 1;
                viz[vecin] = 1;
            }
        }
    }
}
int main()
{
    fin >> n >> m >> s;
    for (int i=1; i<=m; i++)
    {
        int x, y;
        fin >> x >> y;
        la[x].push_back(y);
    }
    for (int i=1; i<=n; i++)
    {
        dist[i]=-1;
        viz[i]=0;
    }
    q.push(s);
    dist[s]=0;
    viz[s]=1;
    bfs();
    for (int i=1; i<=n; i++)
    {
        fout << dist[i] << " ";
    }
}