// Author: Klay Thompson
// Problem: C. 白兔迷宫
// Memory Limit: 1024 MB
// Time Limit: 1000 ms
// 
// Powered by CP Editor (https://cpeditor.org)

#include <bits/stdc++.h>

#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

template<class T>inline void chkmn(T &x, T y) { if (y < x) x = y; }
template<class T>inline void chkmx(T &x, T y) { if (y > x) x = y; }

using namespace std;

template <int P>
class mod_int {
  using Z = mod_int;

private:
  static int mo(int x) { return x < 0 ? x + P : x; }

public:
  int x;
  int val() const { return x; }
  mod_int() : x(0) {}
  template <class T>
  mod_int(const T &x_) : x(x_ >= 0 && x_ < P ? static_cast<int>(x_) : mo(static_cast<int>(x_ % P))) {}
  bool operator==(const Z &rhs) const { return x == rhs.x; }
  bool operator!=(const Z &rhs) const { return x != rhs.x; }
  Z operator-() const { return Z(x ? P - x : 0); }
  Z pow(long long k) const {
    Z res = 1, t = *this;
    while (k) {
      if (k & 1) res *= t;
      if (k >>= 1) t *= t;
    }
    return res;
  }
  Z &operator++() {
    x < P - 1 ? ++x : x = 0;
    return *this;
  }
  Z &operator--() {
    x ? --x : x = P - 1;
    return *this;
  }
  Z operator++(int) {
    Z ret = x;
    x < P - 1 ? ++x : x = 0;
    return ret;
  }
  Z operator--(int) {
    Z ret = x;
    x ? --x : x = P - 1;
    return ret;
  }
  Z inv() const { return pow(P - 2); }
  Z &operator+=(const Z &rhs) {
    (x += rhs.x) >= P && (x -= P);
    return *this;
  }
  Z &operator-=(const Z &rhs) {
    (x -= rhs.x) < 0 && (x += P);
    return *this;
  }
  Z &operator*=(const Z &rhs) {
    x = 1ULL * x * rhs.x % P;
    return *this;
  }
  Z &operator/=(const Z &rhs) { return *this *= rhs.inv(); }
#define setO(T, o)                                 \
  friend T operator o(const Z &lhs, const Z &rhs) {\
    Z res = lhs;                                   \
    return res o## = rhs;                          \
  }
  setO(Z, +) setO(Z, -) setO(Z, *) setO(Z, /)
#undef setO
};
const int P = 998244353;
using Z = mod_int<P>;

const int maxn = 310;

int n, m, s, t, deg[maxn];
Z a[maxn][maxn], noz[maxn], dp[maxn], dp2[maxn];
vector<int> e0[maxn], e1[maxn];
// dp: 走到终点的期望得分
// dp2: 走到终点且不再经过清空边的期望得分
// f: 走到终点的期望得分平方
// g: 走到终点且不再经过清空边的期望得分平方
// h: 走到终点且还会经过清空边的期望得分平方

void gauss(int n) {
  rep (i, 1, n) {
    int pos = i;
    rep (j, i + 1, n) if (a[j][i].val()) pos = j;
    if (i != pos) {
      rep (j, 1, n + 1) swap(a[i][j], a[pos][j]);
    }
    rep (j, 1, n) if (i != j) {
      Z coe = a[j][i] / a[i][i];
      rep (k, 1, n + 1) a[j][k] -= coe * a[i][k];
    }
  }
}

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n >> m >> s >> t;
  rep (i, 1, m) {
    int u, v, w;
    cin >> u >> v >> w, deg[u]++;
    if (w) e1[u].emplace_back(v);
    else e0[u].emplace_back(v);
  }
  rep (i, 1, n) rep (j, 1, n + 1) a[i][j] = 0;
  rep (i, 1, n) {
    if (i != t) {
      Z ideg = Z(deg[i]).inv();
      a[i][i] = P - 1;
      for (int j : e1[i]) a[i][j] += ideg;
    } else {
      a[i][i] = 1, a[i][n + 1] = 1;
    }
  }
  gauss(n);
  rep (i, 1, n) noz[i] = a[i][n + 1] / a[i][i];
  rep (i, 1, n) rep (j, 1, n + 1) a[i][j] = 0;
  rep (i, 1, n) {
    if (i != t) {
      Z ideg = Z(deg[i]).inv();
      for (int j : e1[i]) a[i][j]++, a[i][n + 1] -= noz[j];
      for (int j : e0[i]) a[i][j]++;
      rep (j, 1, n + 1) a[i][j] *= ideg;
      a[i][i] -= 1;
    } else {
      a[i][i] = 1;
    }
  }
  gauss(n);
  rep (i, 1, n) dp[i] = a[i][n + 1] / a[i][i];
  rep (i, 1, n) rep (j, 1, n + 1) a[i][j] = 0;
  rep (i, 1, n) {
    if (i != t) {
      Z ideg = Z(deg[i]).inv();
      for (int j : e1[i]) a[i][j]++, a[i][n + 1]--;
      rep (j, 1, n + 1) a[i][j] *= ideg;
      a[i][i] -= 1;
    } else {
      a[i][i] = 1;
    }
  }
  gauss(n);
  rep (i, 1, n) dp2[i] = a[i][n + 1] / a[i][i];
  rep (i, 1, 3 * n) rep (j, 1, 3 * n + 1) a[i][j] = 0;
  rep (i, 1, n) {
    if (i != t) {
      for (int j : e1[i]) {
        a[i][j + n] += noz[j], a[i][3 * n + 1] -= (2 * dp[j] + 1) * noz[j];
        a[i][j + 2 * n] += 1 - noz[j];
      }
      for (int j : e0[i]) {
        a[i][j] += 1;
      }
      Z ideg = Z(deg[i]).inv();
      rep (j, 1, 3 * n + 1) a[i][j] *= ideg;
      a[i][i] -= 1;
    } else {
      a[i][i] = 1;
    }
  }
  rep (i, 1, n) {
    if (i != t) {
      for (int j : e1[i]) {
        a[i + n][j + n] += 1, a[i + n][3 * n + 1] -= 2 * dp2[j] + 1;
      }
      Z ideg = Z(SZ(e1[i])).inv();
      rep (j, 1, 3 * n + 1) a[i + n][j] *= ideg;
      a[i + n][i + n] -= 1;
    } else {
      a[i + n][i + n] = 1;
    }
  }
  rep (i, 1, n) {
    if (i != t) {
      for (int j : e1[i]) {
        a[i + 2 * n][j + 2 * n] += 1;
      }
      for (int j : e0[i]) {
        a[i + 2 * n][j] += 1;
      }
      Z ideg = Z(deg[i]).inv();
      rep (j, 1, 3 * n + 1) a[i + 2 * n][j] *= ideg;
      a[i + 2 * n][i + 2 * n] -= 1;
    } else {
      a[i + 2 * n][i + 2 * n] = 1;
    }
  }
  gauss(3 * n);
  Z f = a[1][3 * n + 1] / a[1][1];
  Z ans = (n * f - dp[1] * dp[1]) / n / n;
  cout << dp[1].val() << " " << ans.val() << '\n';
}