#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/rope>

#define ll long long
#define pb push_back
#define f first
#define s second
#define sz(x) (int)(x).size()
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define ios ios_base::sync_with_stdio(false);cin.tie(NULL)
#define ld long double
#define li __int128

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag,tree_order_statistics_node_update>; ///find_by_order(),order_of_key()
template<int D, typename T>struct vec : public vector<vec<D - 1, T>> {template<typename... Args>vec(int n = 0, Args... args) : vector<vec<D - 1, T>>(n, vec<D - 1, T>(args...)) {}};
template<typename T>struct vec<1, T> : public vector<T> {vec(int n = 0, T val = T()) : vector<T>(n, val) {}};
template<class T1,class T2> ostream& operator<<(ostream& os, const pair<T1,T2>& a) { os << '{' << a.f << ", " << a.s << '}'; return os; }
template<class T> ostream& operator<<(ostream& os, const vector<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const deque<T>& a){os << '{';for(int i=0;i<sz(a);i++){if(i>0&&i<sz(a))os << ", ";os << a[i];}os<<'}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const set<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T> ostream& operator<<(ostream& os, const multiset<T,greater<T> >& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
template<class T1,class T2> ostream& operator<<(ostream& os, const map<T1,T2>& a) {os << '{';int i=0;for(auto p:a){if(i>0&&i<sz(a))os << ", ";os << p;i++;}os << '}';return os;}
int ri(){int x;scanf("%i",&x);return x;}
void rd(int&x){scanf("%i",&x);}
void rd(long long&x){scanf("%lld",&x);}
void rd(double&x){scanf("%lf",&x);}
void rd(long double&x){scanf("%Lf",&x);}
void rd(string&x){cin>>x;}
void rd(char*x){scanf("%s",x);}
template<typename T1,typename T2>void rd(pair<T1,T2>&x){rd(x.first);rd(x.second);}
template<typename T>void rd(vector<T>&x){for(T&p:x)rd(p);}
template<typename C,typename...T>void rd(C&a,T&...args){rd(a);rd(args...);}
//istream& operator>>(istream& is,__int128& a){string s;is>>s;a=0;int i=0;bool neg=false;if(s[0]=='-')neg=true,i++;for(;i<s.size();i++)a=a*10+s[i]-'0';if(neg)a*=-1;return is;}
//ostream& operator<<(ostream& os,__int128 a){bool neg=false;if(a<0)neg=true,a*=-1;ll high=(a/(__int128)1e18);ll low=(a-(__int128)1e18*high);string res;if(neg)res+='-';if(high>0){res+=to_string(high);string temp=to_string(low);res+=string(18-temp.size(),'0');res+=temp;}else res+=to_string(low);os<<res;return os;}

const int N=2e5+5;
int lz[4*N],n,m,s;
void prop(int i){
	if(lz[i]==0)return;
	lz[2*i]+=lz[i];
	lz[2*i+1]+=lz[i];
	lz[i]=0;
}
void st(int p,int x,int l=0,int r=n-1,int i=1){
	if(l==r){
		lz[i]=x;
		return;
	}
	int m=(l+r)>>1;
	prop(i);
	if(p<=m){
		st(p,x,l,m,2*i);
	}
	else{
		st(p,x,m+1,r,2*i+1);
	}
}
int gt(int p,int l=0,int r=n-1,int i=1){
	if(l==r)return lz[i];
	int m=(l+r)>>1;
	prop(i);
	if(p<=m)return gt(p,l,m,2*i);
	else return gt(p,m+1,r,2*i+1);
}
void add(int qs,int qe,int x,int l=0,int r=n-1,int i=1){
	if(qs>r||qe<l)return;
	if(qs<=l&&qe>=r){
		lz[i]+=x;
		return;
	}
	int m=(l+r)>>1;
	prop(i);
	add(qs,qe,x,l,m,2*i);
	add(qs,qe,x,m+1,r,2*i+1);
}

int main()
{
	scanf("%i %i %i",&n,&m,&s);
	s--;
	vector<pair<int,int>> br;
	for(int i=0;i<m;i++){
		int d,t;
		scanf("%i %i",&d,&t);
		t--;
		br.pb({d,t});
	}
	sort(all(br));
	reverse(all(br));
	int cnt=1;
	st(s,0);
	for(int i=1;;i++){
		if(cnt==n)break;
		int x=(s+i)%n;
		st(x,i);
		cnt++;
		if(cnt==n)break;
		x=(s-i+n)%n;
		st(x,i);
		cnt++;
	}
	for(auto p:br){
		/*printf("%i %i\n",p.f,p.s);
		for(int i=0;i<n;i++){
			printf("%i ",gt(i));
		}
		printf("\n");*/
		int i=p.s;
		int j=(p.s+1)%n;
		int a=gt(i);
		int b=gt(j);
		//printf("%i %i  %i %i\n",i,j,a,b);
		if(a==b) continue;
		st(i,b);
		st(j,a);
		assert(abs(a-b)==1);
		if(a>b){ // 2 1 -> 1 2
			int x=(j+1)%n;
			int v=gt(x);
			if(v==a-2){
				st(j,a-1);
			}
			
			x=(i-1+n)%n;
			v=gt(x);
			if(v!=b+2)continue;
			int l=2,r=n-1;
			while(l!=r){
				int m=(l+r)>>1;
				x=(i-m+n)%n;
				v=gt(x);
				if(v!=b+m+1){
					r=m;
				}
				else{
					l=m+1;
				}
			}
			x=(i-l+1+n)%n;
			if(x<i){
				add(x,i-1,-1);
			}
			else{
				add(0,i-1,-1);
				add(x,n-1,-1);
			}
		}
		else{
			int x=(i-1+n)%n;
			int v=gt(x);
			if(v==b-2){
				st(i,b-1);
			}
			
			x=(j+1)%n;
			v=gt(x);
			if(v!=a+2)continue;
			int l=2,r=n-1;
			while(l!=r){
				int m=(l+r)>>1;
				x=(j+m)%n;
				v=gt(x);
				if(v!=a+m+1){
					r=m;
				}
				else{
					l=m+1;
				}
			}
			x=(j+l-1)%n;
			if(x>j){
				add(j+1,x,-1);
			}
			else{
				add(j+1,n-1,-1);
				add(0,j,-1);
			}
		}
	}
	for(int i=0;i<n;i++){
		printf("%i\n",gt(i));
	}
	return 0;
}