#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")

////////////////////////////////////////////////////////////////////////////////
// Barrett
struct ModInt {
  static unsigned M;
  static unsigned long long NEG_INV_M;
  static void setM(unsigned long long m) { M = m; NEG_INV_M = -1ULL / M; }
  unsigned x;
  ModInt() : x(0U) {}
  ModInt(unsigned x_) : x(x_ % M) {}
  ModInt(unsigned long long x_) : x(x_ % M) {}
  ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  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) {
    const unsigned long long y = static_cast<unsigned long long>(x) * a.x;
    const unsigned long long q = static_cast<unsigned long long>((static_cast<unsigned __int128>(NEG_INV_M) * y) >> 64);
    const unsigned long long r = y - M * q;
    x = r - M * (r >= 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; }
};
unsigned ModInt::M;
unsigned long long ModInt::NEG_INV_M;
// !!!Use ModInt::setM!!!
////////////////////////////////////////////////////////////////////////////////

using Mint = ModInt;


/*
  fix t != 0
  F[u] := Pr[u -> t]
  F[0] = 0
  F[t] = 1
  F[u] = \sum[i] P[i] F[u+e[i]]  (u != 0, t)
  
  F(x) = \sum[u] F[u] x^u
       = x^t + \sum[u!=0,t] F[u] x^u
       = x^t + \sum[u!=0,t] \sum[i] P[i] F[u+e[i]] x^u
       = x^t + \sum[v] \sum[i] P[i] F[v] x^(v-e[i]) - \sum[i] P[i] F[e[i]] - \sum[i] P[i] F[t+e[i]] x^t
       =: G(x) F(x) + a + b x^t
  G(x) = \sum[i] P[i] x^(-i)
  Pr[start -> t] = -a
  
  F(1) = G(1) F(1) + a + b
  G(1) = 1
  b = -a
  (1 - G(x)) F(x) = a (x^0 - x^t)
  
  w: vector of roots of unity
  H(w) = 1 - w^t
  F(w) = (1 - w^t) / (1 - G(w))  (w != 1)
  F(1) = -\sum[w!=1] F(w)
  F[t] = (1/M) (F(1) + \sum[w!=1] w^-t F(w))
       = (1/M) \sum[w!=1] (w^(-t) - 2 + w^t) / (1 - G(w))
*/

int N, MO, I;
vector<int> L;
vector<Mint> P, D;

int M;
vector<int> LL;

void dft(vector<Mint> &fs, bool inv) {
  for (int i = 0; i < N; ++i) {
    const Mint d = inv ? D[i].inv() : D[i];
    for (int u = 0; u < M; u += LL[i + 1]) for (int v = u; v < u + LL[i]; ++v) {
      vector<Mint> as(L[i]);
      for (int k = 0; k < L[i]; ++k) as[k] = fs[v + k * LL[i]];
      vector<Mint> bs(L[i], 0);
      Mint dk = 1;
      for (int k = 0; k < L[i]; ++k) {
        Mint dkl = 1;
        for (int l = 0; l < L[i]; ++l) {
          bs[k] += dkl * as[l];
          dkl *= dk;
        }
        dk *= d;
      }
      for (int k = 0; k < L[i]; ++k) fs[v + k * LL[i]] = bs[k];
    }
  }
  if (inv) {
    const Mint invM = Mint(M).inv();
    for (int u = 0; u < M; ++u) {
      fs[u] *= invM;
    }
  }
}

int main() {
  for (; ~scanf("%d%d%d", &N, &MO, &I); ) {
    Mint::setM(MO);
    L.resize(N);
    P.resize(N);
    D.resize(N);
    for (int i = 0; i < N; ++i) {
      scanf("%d%u%u", &L[i], &P[i].x, &D[i].x);
    }
    
    {
      Mint sumP = 0;
      for (int i = 0; i < N; ++i) {
        sumP += P[i];
      }
      const Mint invSumP = sumP.inv();
      for (int i = 0; i < N; ++i) {
        P[i] *= invSumP;
      }
    }
    
    LL.resize(N + 1);
    LL[0] = 1;
    for (int i = 0; i < N; ++i) {
      LL[i + 1] = LL[i] * L[i];
    }
    M = LL[N];
cerr<<"N = "<<N<<", M = "<<M<<", I = "<<I<<", L = "<<L<<endl;
    
    vector<Mint> gs(M, 0);
    gs[0] += 1;
    for (int i = 0; i < N; ++i) {
      gs[(L[i] - 1) * LL[i]] -= P[i];
    }
    dft(gs, false);
    assert(!gs[0]);
    for (int u = 1; u < M; ++u) {
      assert(gs[u]);
      gs[u] = gs[u].inv();
    }
    dft(gs, true);
    
    Mint ans = 1;
    for (int t = 1; t < M; ++t) {
      int tt = 0;
      for (int i = 0; i < N; ++i) {
        tt += ((L[i] - t / LL[i] % L[i]) % L[i]) * LL[i];
      }
      const Mint f = gs[t] - 2 * gs[0] + gs[tt];
      assert(f);
      ans -= f.inv();
    }
    printf("%u\n", ans.x);
  }
  return 0;
}