#include <fstream>
#include <vector>
#include <queue>
#include <string.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int viz[100001];
vector <int> v[100001];
queue <int> q;
void BFS(int x)
{
    int i;
    memset(viz,0,sizeof(viz));
    viz[x]=1;
    q.push(x);
    while(!q.empty())
    {
        x=q.front();
        q.pop();
        for(i=0;i<v[x].size();i++)
            if(viz[v[x][i]]==0)
            {
                viz[v[x][i]]=viz[x]+1;
                q.push(v[x][i]);
            }
    }
}
int main()
{
    int n,m,s,i,x,y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    BFS(s);
    for(i=1;i<=n;i++)
        fout<<viz[i]-1<<' ';
    return 0;
}