#include<fstream>
#include<vector>
#include<deque>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,start,x,y;
vector<int>v[100001];
deque<int>q;
bool viz[100001];
int dist[100001];
int i;
int main()
{
    f>>n>>m>>start;
    while(m--)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    viz[start]=1;
    q.push_back(start);
    while(!q.empty())
    {
        int nod=q.front();
        q.pop_front();
        for(i=0;i<v[nod].size();i++)
        {
            if(viz[v[nod][i]]==0)
            {

                viz[v[nod][i]]=1;
                dist[v[nod][i]]=dist[nod]+1;
                q.push_back(v[nod][i]);
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(i!=start&&dist[i]==0)
        {
            g<<"-1 ";
        }
        else
        {
            g<<dist[i]<<" ";
        }
    }
    return 0;
}