#include <cstdio>
#include <vector>
#include <queue>

using namespace std;

vector <int> graph[100005];
queue <int> q;

int n, m, x, y, s, l[100005];

void lee()
{
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto &v:graph[nod])
        {
            if(l[v] > 0)
                continue;
            l[v]=l[nod]+1;
            q.push(v);
        }
    }
    
}

int main()
{
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    
    scanf("%d %d %d", &n, &m, &s);
    
    for(int i=1; i<=m; i++)
    {
        scanf("%d %d", &x, &y);
        graph[x].push_back(y);
    }
    q.push(s);
    l[s]=1;
    lee();
    for(int i=1; i<=n; i++)
        printf("%d ", l[i]-1);
    
    
    return 0;
}