func_code_string: #include <bits/stdc++.h>   using namespace std;   const int MOD = 998244353;   template <typename T>   struct modular {     constexpr modular() : val(0) {}     constexpr modular(const modular<T>& _m) : val(_m.val) {}     template <typename U>     constexpr modular(const U& _r = U()) {       val = -MOD <= _r && _r < MOD ? _r : _r % MOD;       if (val < 0) {         val += MOD;       }     }     const T operator()() { return val; }     template <typename U>     explicit operator U() const {       return static_cast<U>(val);     }     modular<T>& operator+=(const modular<T>& _m) {       if ((val += _m.val) >= MOD) {         val -= MOD;       }       return *this;     }     modular<T>& operator-=(const modular<T>& _m) {       if ((val -= _m.val) < 0) {         val += MOD;       }       return *this;     }     modular<T>& operator*=(const modular<T>& _m) {       val = modular<T>(static_cast<int64_t>(val) * static_cast<int64_t>(_m.val))                 .val;       return *this;     }     modular<T>& operator/=(const modular<T>& _m) {       T a = _m.val, b = MOD, u = 0, v = 1;       while (a != 0) {         T q = b / a;         b -= q * a;         swap(a, b);         u -= q * v;         swap(u, v);       }       return *this *= u;     }     modular<T>& operator=(const modular<T>& _m) {       val = _m.val;       return *this;     }     template <typename U>     modular<T>& operator+=(const U& _r) {       return *this += modular<T>(_r);     }     template <typename U>     modular<T>& operator-=(const U& _r) {       return *this -= modular<T>(_r);     }     template <typename U>     modular<T>& operator*=(const U& _r) {       return *this *= modular<T>(_r);     }     template <typename U>     modular<T>& operator/=(const U& _r) {       return *this /= modular<T>(_r);     }     template <typename U>     modular<T>& operator=(const U& _r) {       val = modular<T>(_r).val;       return *this;     }     modular<T> operator-() { return modular<T>(-val); }     template <typename U>     friend bool operator==(const modular<U>&, const modular<U>&);     friend std::istream& operator>>(std::istream& os, modular<T>& _m) {       os >> _m.val;       _m *= 1;       return os;     }     friend std::ostream& operator<<(std::ostream& os, const modular<T>& _m) {       return os << _m.val;     }     template <typename U>     modular<T> exp(U e) {       modular<T> res = 1;       modular<T> b = val;       if (e < 0) {         b = 1 / b;         e *= -1;       }       for (; e; e >>= 1) {         if (e & 1) {           res *= b;         }         b *= b;       }       return res;     }       private:     T val;   };   template <typename T>   inline modular<T> operator+(const modular<T>& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) += _rhs;   }   template <typename T, typename U>   inline modular<T> operator+(const modular<T>& _lhs, const U& _rhs) {     return modular<T>(_lhs) += _rhs;   }   template <typename T, typename U>   inline modular<T> operator+(const U& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) += _rhs;   }   template <typename T>   inline modular<T> operator-(const modular<T>& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) -= _rhs;   }   template <typename T, typename U>   inline modular<T> operator-(const modular<T>& _lhs, const U& _rhs) {     return modular<T>(_lhs) -= _rhs;   }   template <typename T, typename U>   inline modular<T> operator-(const U& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) -= _rhs;   }   template <typename T>   inline modular<T> operator*(const modular<T>& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) *= _rhs;   }   template <typename T, typename U>   inline modular<T> operator*(const modular<T>& _lhs, const U& _rhs) {     return modular<T>(_lhs) *= _rhs;   }   template <typename T, typename U>   inline modular<T> operator*(const U& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) *= _rhs;   }   template <typename T>   inline modular<T> operator/(const modular<T>& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) /= _rhs;   }   template <typename T, typename U>   inline modular<T> operator/(const modular<T>& _lhs, const U& _rhs) {     return modular<T>(_lhs) /= _rhs;   }   template <typename T, typename U>   inline modular<T> operator/(const U& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) /= _rhs;   }   template <typename T>   inline bool operator==(const modular<T>& _lhs, const modular<T>& _rhs) {     return _lhs.val == _rhs.val;   }   template <typename T, typename U>   inline bool operator==(const modular<T>& _lhs, const U& _rhs) {     return _lhs == modular<T>(_rhs);   }   template <typename T, typename U>   inline bool operator==(const U& _lhs, const modular<T>& _rhs) {     return modular<T>(_lhs) == _rhs;   }   template <typename T>   inline bool operator!=(const modular<T>& _lhs, const modular<T>& _rhs) {     return !(_lhs == _rhs);   }   template <typename T, typename U>   inline bool operator!=(const modular<T>& _lhs, const U& _rhs) {     return !(_lhs == _rhs);   }   template <typename T, typename U>   inline bool operator!=(const U& _lhs, const modular<T>& _rhs) {     return !(_lhs == _rhs);   }   const int N = 3003;   modular<int> dp[N][N];   void solve() {     memset(dp, 0, sizeof dp);     int n, m;     cin >> n >> m;     vector<int> a(n);     vector<int> w(n);     for (auto& x : a) {       cin >> x;     }     int H = 0, T = 0;     for (int i = 0; i < n; i++) {       int x;       cin >> x;       w[i] = x;       if (a[i])         H += x;       else         T += x;     }     int tot = H + T;     dp[0][0] = 1;     for (int i = 0; i < m; i++) {       for (int j = 0; j <= i; j++) {         if (i - j <= T) {           dp[i + 1][j] += dp[i][j] * (T - (i - j)) / (tot + j - (i - j));           dp[i + 1][j + 1] += dp[i][j] * (H + j) / (tot + j - (i - j));         }       }     }     modular<int> ad = 0;     modular<int> mi = 0;     for (int j = 0; j <= m; j++) {       ad += dp[m][j] * j;       mi += dp[m][j] * (m - j);     }     vector<modular<int> > res(n);     for (int i = 0; i < n; i++) {       if (a[i]) {         res[i] = w[i] + ad * w[i] / H;       } else {         res[i] = w[i] - mi * w[i] / T;       }     }     for (auto& x : res) {       cout << x <<   n ;     }   }   int main() {     ios_base::sync_with_stdio(false);     cin.tie(NULL);     solve();     cout << endl;   }   