#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// --------------------------------------------------------
template <class T>
bool chmax(T& a, const T b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T& a, const T b) {
    if (b < a) {
        a = b;
        return 1;
    }
    return 0;
}
#define FOR(i, l, r) for (int i = (l); i < (r); ++i)
#define RFOR(i, l, r) for (int i = (r)-1; (l) <= i; --i)
#define REP(i, n) FOR(i, 0, n)
#define RREP(i, n) RFOR(i, 0, n)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define SORT(c) sort(ALL(c))
#define RSORT(c) sort(RALL(c))
#define MIN(c) *min_element(ALL(c))
#define MAX(c) *max_element(ALL(c))
#define SUM(c) accumulate(ALL(c), 0)
#define SUMLL(c) accumulate(ALL(c), 0LL)
#define SZ(c) ((int)(c).size())
#define CIN(c) cin >> (c)
#define COUT(c) cout << (c) << '\n'
#define debug(x) cerr << #x << " = " << (x) << '\n';
using P = pair<ll, ll>;
using VP = vector<P>;
using VVP = vector<VP>;
using VS = vector<string>;
using VI = vector<int>;
using VVI = vector<VI>;
using VLL = vector<ll>;
using VVLL = vector<VLL>;
using VB = vector<bool>;
using VVB = vector<VB>;
using VD = vector<double>;
using VVD = vector<VD>;
static const double EPS = 1e-10;
static const double PI = acos(-1.0);
static const ll MOD = 1000000007;
// static const ll MOD = 998244353;
// static const int INF = (1 << 30) - 1; // 1073741824 - 1
static const ll INF = (1LL << 60) - 1; // 4611686018427387904 - 1
ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

const int dx[4] = {1, 0, -1, 0};
const int dy[4] = {0, 1, 0, -1};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n;
    cin >> n;

    ll ans = INF;
    REP(i, n) {
        ll a, p, x;
        cin >> a >> p >> x;
        if (a < x) {
            chmin(ans, p);
        }
    }
    if (ans == INF) ans = -1;
    COUT(ans);
}
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define all(v) v.begin(),v.end()
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

ll mod_pow(ll x,ll n){
  x%=MOD;
  ll res=1;
  while(n>0){
    if(n&1) res=res*x%MOD;
    x=x*x%MOD;
    n>>=1;
  }
  return res;
}

ll mod_inverse(ll x){
  return mod_pow(x,MOD-2);
}

void add(ll &a,ll b){
  a=(a+b)%MOD;
}

void mul(ll &a,ll b){
  a%=MOD;b%=MOD;
  a=a*b%MOD;
}

typedef vector<ll> vec;
typedef vector<vec> mat;

mat mul(mat &A,mat &B){
  mat C(A.size(),vec(B[0].size()));
  for(int i=0;i<A.size();i++){
    for(int k=0;k<B.size();k++){
      for(int j=0;j<B[0].size();j++){
        C[i][j]=(C[i][j]+(A[i][k]*B[k][j])%MOD)%MOD;
      }
    }
  }
  return C;
}

// C=pow(A,n)
mat pow(mat A,ll n){
  mat B(A.size(),vec(A.size()));
  for(int i=0;i<A.size();i++){
    B[i][i]=1;
  }
  while(n>0){
    if(n&1) B=mul(B,A);
    A=mul(A,A);
    n=(n>>1);
  }
  return B;
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);

  int N,M,K;
  cin>>N>>M>>K;
  vector<ll> A(N);
  rep(i,N) cin>>A[i];

  vector<int> X(M),Y(M);
  rep(i,M) cin>>X[i]>>Y[i];

  rep(i,M) X[i]--,Y[i]--;

  vector<vector<int>> g(N);
  rep(i,M){
    g[X[i]].push_back(Y[i]);
    g[Y[i]].push_back(X[i]);
  }

  mat P(N,vec(N,0));
  for(int i=0;i<N;i++){
    int deg=g[i].size();
    ll inv=mod_inverse(M);
    {
      ll coef=M-deg;
      mul(coef,inv);
      add(P[i][i],coef);
    }

    {
      ll coef=deg;
      mul(coef,inv);
      mul(coef,mod_inverse(2));
      add(P[i][i],coef);

      mul(coef,mod_inverse(deg));
      for(auto n:g[i]){
        add(P[i][n],coef);
      }
    }
  }

  mat C=pow(P,K);
  mat B(N,vec(1,0));
  rep(i,N) B[i][0]=A[i];

  B=mul(C,B);

  rep(i,N) cout<<B[i][0]<<"\n";

  return 0;
}
