#include<bits/stdc++.h>
using namespace std;
#define int long long
const int mod = 1000000007;
int qp(int p,int q){
	int ans = 1,pro = p;
	while(q){
		if(q&1)ans = ans*pro%mod;
		pro = pro*pro%mod;q>>=1;
	}
	return ans;
}
int n,k,A;
int s[15],v[15];
int dp[50005];
int val[50005];
signed main(){
	cin >> n >> k >> A;
	if(k == 0){n--;
		int pro = 1;
		for(int i = n+1;i<=2*n;i++)pro = pro*i%mod;
		for(int i = 1;i<=n+1;i++)pro = pro*qp(i,mod-2)%mod;
		cout << pro << endl;return 0;
	}
	for(int i = 1;i<=n;i++)val[i] = A;
	for(int i = 1;i<=k;i++){
		int s,v;cin >>s  >> v;
		val[s] = v;
	}
	dp[1] =1;
	for(int i = 2;i<=n;i++){
		for(int j = 1;j<i;j++){
			dp[i] = (dp[j]*dp[i-j]%mod*val[j]+dp[i])%mod;
		}
	}
	for(int i = 1;i<=n;i++)cout << dp[i] << ' ';cout << endl;
	cout << dp[n] << endl;
	return 0;
}/*
20 0 1

*/