#include <fstream>
#include <vector>
#include <queue>
using namespace std;
vector <int> g[100001];
queue <int> q;
int dist[100001];
bool been2[100001];
ifstream in("bfs.in");
ofstream out("bfs.out");
int main()
{
    int n,m,i,nod1,nod2,nod;
    in>>n>>m>>nod;
    for(i=1;i<=m;i++)
    {
        in>>nod1>>nod2;
        g[nod1].push_back(nod2);
    }
    q.push(nod);
    while(q.empty()==0)
    {
        int a=q.front();
        been2[a]=1;
        for(i=0;i<g[a].size();i++)
        {
            if(been2[g[a][i]]==0)
            {
                dist[g[a][i]]=dist[a]+1;
                q.push(g[a][i]);
            }
        }
        q.pop();
    }
    for(i=1;i<=n;i++)
    {
        if(i==nod)
            out<<"0 ";
        else if(dist[i]==0)
            out<<"-1 ";
        else out<<dist[i]<<" ";
    }
    return 0;
}