#include <fstream>
#include <vector>
#include <queue>
#include <cstring>
using namespace std;
const int MAX=1e5+12;
queue <int>q;
vector <int>v[MAX];
int dist[MAX];
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int main()
{
    int n,m,s;
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    memset ( dist , 0x3f , sizeof ( dist ) ) ;
    dist[s]=0;
    q.push(s);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(auto vecin:v[nod])
        {
            if(dist[vecin]>dist[nod]+1)
            {
                dist[vecin]=dist[nod]+1;
                q.push(vecin);

            }
        }
    }

    for(int i=1;i<=n;i++)
        {   if(dist[i]>=n+1)dist[i]=-1;
            fout<<dist[i]<<" ";
        }
    return 0;
}