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

using namespace std;

vector<int> v[100001];
queue<int> q;
int n,m,s;
int sol[100001];

void bfs(int nod)
{
    int top;
    vector<int>::iterator it;
    
    q.push(s);
    
    while(!q.empty())
    {
        top = q.front();
        for(it = v[top].begin(); it != v[top].end(); it ++)
        {
           if(sol[*it] == -1)
           {
               sol[*it] = sol[top] + 1;
               q.push(*it);
           }
        }
        q.pop();
    }
}

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