#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1'000'000'009;
using Mint = ModInt<MO>;

constexpr int LIM_INV = 410;
Mint inv[LIM_INV], fac[LIM_INV], invFac[LIM_INV];

void prepare() {
  inv[1] = 1;
  for (int i = 2; i < LIM_INV; ++i) {
    inv[i] = -((Mint::M / i) * inv[Mint::M % i]);
  }
  fac[0] = invFac[0] = 1;
  for (int i = 1; i < LIM_INV; ++i) {
    fac[i] = fac[i - 1] * i;
    invFac[i] = invFac[i - 1] * inv[i];
  }
}
Mint binom(Int n, Int k) {
  if (n < 0) {
    if (k >= 0) {
      return ((k & 1) ? -1 : +1) * binom(-n + k - 1, k);
    } else if (n - k >= 0) {
      return (((n - k) & 1) ? -1 : +1) * binom(-k - 1, n - k);
    } else {
      return 0;
    }
  } else {
    if (0 <= k && k <= n) {
      assert(n < LIM_INV);
      return fac[n] * invFac[k] * invFac[n - k];
    } else {
      return 0;
    }
  }
}


constexpr Mint OMEGA = 115381398;
const Mint WS[3] = {1, OMEGA, OMEGA * OMEGA};
const Mint INV_WS[3] = {1, OMEGA * OMEGA, OMEGA};

int N, M;
Int K;
vector<int> A, B;

Mint f[130][130], g[130][130];

void dft(const Mint *ws) {
  // g[a][b] = [y^az^b] \sum[i,j] (1+y+z)^(N-i-j) (1+wy+w^2z)^i (1+w^2y+wz)^j
  memset(g, 0, sizeof(g));
  for (int i = 0; i <= N; ++i) for (int j = 0; j <= N - i; ++j) {
    for (int a0 = 0; a0 <= (N-i-j); ++a0) for (int b0 = 0; b0 <= (N-i-j) - a0; ++b0)
    for (int a1 = 0; a1 <= i      ; ++a1) for (int b1 = 0; b1 <= i       - a1; ++b1)
    for (int a2 = 0; a2 <= j      ; ++a2) for (int b2 = 0; b2 <= j       - a2; ++b2)
    {
      Mint t = f[i][j];
      t *= (fac[N-i-j] * invFac[(N-i-j)-a0-b0] * invFac[a0] * invFac[b0]);
      t *= (fac[i] * invFac[i-a1-b1] * invFac[a1] * invFac[b1]);
      t *= (fac[j] * invFac[j-a2-b2] * invFac[a2] * invFac[b2]);
      t *= ws[(a1 + 2*b1 + 2*a2 + b2) % 3];
      g[a0 + a1 + a2][b0 + b1 + b2] += t;
    }
  }
  memcpy(f, g, sizeof(g));
}

int main() {
  prepare();
  
  for (; ~scanf("%d%d%lld", &N, &M, &K); ) {
    A.resize(M);
    B.resize(M);
    for (int m = 0; m < M; ++m) {
      scanf("%d%d", &A[m], &B[m]);
    }
    
    memset(f, 0, sizeof(f));
    for (int m = 0; m < M; ++m) {
      f[A[m]][B[m]] += 1;
    }
    
    for (int i = 0; i <= N; ++i) for (int j = 0; j <= N - i; ++j) f[i][j] *= (fac[N] * invFac[N-i-j] * invFac[i] * invFac[j]);
    dft(WS);
    for (int i = 0; i <= N; ++i) for (int j = 0; j <= N - i; ++j) f[i][j] *= (invFac[N] * fac[N-i-j] * fac[i] * fac[j]);
    for (int i = 0; i <= N; ++i) for (int j = 0; j <= N - i; ++j) f[i][j] = f[i][j].pow(K);
    for (int i = 0; i <= N; ++i) for (int j = 0; j <= N - i; ++j) f[i][j] *= (fac[N] * invFac[N-i-j] * invFac[i] * invFac[j]);
    dft(INV_WS);
    const Mint inv3 = Mint(3).pow(-N);
    for (int i = 0; i <= N; ++i) for (int j = 0; j <= N - i; ++j) f[i][j] *= inv3;
    
    for (int i = 0; i <= N; ++i) {
      for (int j = 0; j <= N - i; ++j) {
        if (j) printf(" ");
        printf("%u", f[i][j].x);
      }
      puts("");
    }
  }
  return 0;
}