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