#include <fstream>
#include <queue>
#include <algorithm>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
int n,m,S,d[100005];
vector<int>l[100005];
queue<int>q;
int main()
{
    cin>>n>>m>>S;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        l[x].push_back(y);
    }
    q.push(S);
    d[S]=1;
    while(!q.empty())
    {
        int nod=q.front();
        q.pop();
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i];
            if(d[vecin]==0)
            {
                d[vecin]=d[nod]+1;
                q.push(vecin);
            }
        }
    }
    for(int i=1;i<=n;i++)
        cout<<d[i]-1<<" ";
    return 0;
}