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

using namespace std;

queue<int> q;
vector<int> v[100010];
int d[100010];

int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,S,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);
    }
    q.push(S);
    d[S]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<v[nod].size();i++)
        {
            int vec=v[nod][i];
            if(d[vec]==0)
            {
                d[vec]=d[nod]+1;
                q.push(vec);
            }
        }
    }
    for(int i=1;i<=n;i++) printf("%d ",d[i]-1);
    return 0;
}