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

using namespace std;

ifstream cin("bfs.in");
ofstream cout("bfs.out");

const int N = 100001;
int n,m,s;
vector <int> g[N];
queue <int> q;
int v[N],d[N];

void citire()
{
    int x,y;
    for(int i = 1; i <= m; i++)
    {
        cin >> x >> y;
        g[x].push_back(y);
    }
}

int main()
{
    cin >> n >> m >> s;
    citire();
    q.push(s);
    while(!q.empty())
    {
        int node = q.front();
        v[node] = 1;
        q.pop();
        for(int i = 0; i < g[node].size(); i++)
        {
            if(v[g[node][i]] == 0)
            {
                q.push(g[node][i]);
                d[g[node][i]] = d[node] + 1;
                v[g[node][i]] = 1;
            }
        }
    }
    for(int i = 1; i <= n; i++)
        cout << d[i] << " ";
    return 0;
}