#include <cstdio>
#include <bitset>
#include <queue>

using namespace std;

vector<int> g[100010];
bitset<100010> vaz;
int d[100010];

void bfs(int nod)
{
    queue<int> q;
    vaz[nod]=1;
    q.push(nod);
    d[nod]=0;
    while(!q.empty())
    {
        int nod=q.front();q.pop();
        for(vector<int>::iterator it=g[nod].begin();it!=g[nod].end();it++)
            if(!vaz[*it])
            {
                vaz[*it]=1;
                d[*it]=d[nod]+1;
                q.push(*it);
            }
    }
}

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