# include <cstdio>
# include <vector>
# include <queue>
# include <string.h>

using namespace std;

vector<int> v[10010];
queue <int> q;
int i, lev[100010],j,n,x,y,root,m;
bool use[100010];
int main()
{
    memset(lev, -1, sizeof(lev));
    freopen("bfs.in", "r",stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d %d %d", &n, &m, &root);
    for (i=0; i<m; i++)
    {
        scanf("%d %d", &x, &y);
        v[x].push_back(y);
    }

    use[root] = true;
    lev[root] = 0;
    q.push(root);

    while(!q.empty())
    {
        x = q.front();
        for (i=0; i<v[x].size(); i++)
             if (use[v[x][i]] == false)
        {

            use[v[x][i]] = true;
            lev[v[x][i]] = lev[x] + 1;
            q.push(v[x][i]);
        }
        q.pop();
    }

    for (i=1; i<=n; i++)
        printf("%d ", lev[i]);
    return 0;
}