#include <fstream>
#include <queue>
#include <vector>
using namespace std;

ifstream in("bfs.in");
ofstream out("bfs.out");

int n,m,s;
int ans[100001];
vector<int> g[100001];
queue<int> q;

int main()
{
    int x,y;
    in>>n>>m>>s;

    for(int i=1; i<=m; i++)
    {
        in>>x>>y;
        g[x].push_back(y);
    }

    int fr;
    q.push(s); ans[s]=1;
    while(!q.empty())
    {
        fr=q.front();
        for(int i=0; i<g[fr].size(); i++)
                if(!ans[g[fr][i]])
                {
                    q.push(g[fr][i]);
                    ans[g[fr][i]]=ans[fr]+1;
                }
        q.pop();
    }

    for(int i=1; i<=n; i++) out<<ans[i]-1<<" ";
    return 0;
}