Language: C++

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define pb(x) push_back(x)
#define mp(a, b) make_pair(a, b)
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define lscan(x) scanf("%I64d", &x)
#define lprint(x) printf("%I64d", x)
#define rep(i, n) for (ll i = 0; i < (n); i++)
#define rep2(i, n) for (ll i = n - 1; i >= 0; i--)
const int mod = 998244353;
ll gcd(ll a, ll b)
{
	ll c = a % b;
	while (c != 0)
	{
		a = b;
		b = c;
		c = a % b;
	}
	return b;
}
long long extGCD(long long a, long long b, long long &x, long long &y)
{
	if (b == 0)
	{
		x = 1;
		y = 0;
		return a;
	}
	long long d = extGCD(b, a % b, y, x);
	y -= a / b * x;
	return d;
}

struct UnionFind
{
	vector<ll> data;

	UnionFind(int sz)
	{
		data.assign(sz, -1);
	}

	bool unite(int x, int y)
	{
		x = find(x), y = find(y);
		if (x == y)
			return (false);
		if (data[x] > data[y])
			swap(x, y);
		data[x] += data[y];
		data[y] = x;
		return (true);
	}

	int find(int k)
	{
		if (data[k] < 0)
			return (k);
		return (data[k] = find(data[k]));
	}

	ll size(int k)
	{
		return (-data[find(k)]);
	}
};

ll M = 1000000007;

vector<ll> fac(2000011);  //n!(mod M)
vector<ll> ifac(2000011); //k!^{M-2} (mod M)

ll mpow(ll x, ll n)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % M;
		x = x * x % M;
		n = n >> 1;
	}
	return ans;
}
ll mpow2(ll x, ll n, ll mod)
{
	ll ans = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = ans * x % mod;
		x = x * x % mod;
		n = n >> 1;
	}
	return ans;
}
void setcomb()
{
	fac[0] = 1;
	ifac[0] = 1;
	for (ll i = 0; i < 2000010; i++)
	{
		fac[i + 1] = fac[i] * (i + 1) % M; // n!(mod M)
	}
	ifac[2000010] = mpow(fac[2000010], M - 2);
	for (ll i = 2000010; i > 0; i--)
	{
		ifac[i - 1] = ifac[i] * i % M;
	}
}
ll comb(ll a, ll b)
{
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	ll tmp = ifac[a - b] * ifac[b] % M;
	return tmp * fac[a] % M;
}
ll perm(ll a, ll b)
{
	if (a == 0 && b == 0)
		return 1;
	if (a < b || a < 0)
		return 0;
	return fac[a] * ifac[a - b] % M;
}
long long modinv(long long a)
{
	long long b = M, u = 1, v = 0;
	while (b)
	{
		long long t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= M;
	if (u < 0)
		u += M;
	return u;
}
ll modinv2(ll a, ll mod)
{
	ll b = mod, u = 1, v = 0;
	while (b)
	{
		ll t = a / b;
		a -= t * b;
		swap(a, b);
		u -= t * v;
		swap(u, v);
	}
	u %= mod;
	if (u < 0)
		u += mod;
	return u;
}

template <int mod>
struct ModInt
{
	int x;

	ModInt() : x(0) {}

	ModInt(int64_t y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

	ModInt &operator+=(const ModInt &p)
	{
		if ((x += p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator-=(const ModInt &p)
	{
		if ((x += mod - p.x) >= mod)
			x -= mod;
		return *this;
	}

	ModInt &operator*=(const ModInt &p)
	{
		x = (int)(1LL * x * p.x % mod);
		return *this;
	}

	ModInt &operator/=(const ModInt &p)
	{
		*this *= p.inverse();
		return *this;
	}

	ModInt operator-() const { return ModInt(-x); }

	ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }

	ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }

	ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }

	ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }

	bool operator==(const ModInt &p) const { return x == p.x; }

	bool operator!=(const ModInt &p) const { return x != p.x; }

	ModInt inverse() const
	{
		int a = x, b = mod, u = 1, v = 0, t;
		while (b > 0)
		{
			t = a / b;
			swap(a -= t * b, b);
			swap(u -= t * v, v);
		}
		return ModInt(u);
	}

	ModInt pow(int64_t n) const
	{
		ModInt ret(1), mul(x);
		while (n > 0)
		{
			if (n & 1)
				ret *= mul;
			mul *= mul;
			n >>= 1;
		}
		return ret;
	}

	friend ostream &operator<<(ostream &os, const ModInt &p)
	{
		return os << p.x;
	}

	friend istream &operator>>(istream &is, ModInt &a)
	{
		int64_t t;
		is >> t;
		a = ModInt<mod>(t);
		return (is);
	}

	static int get_mod() { return mod; }
};

using mint = ModInt<mod>;

vector<vector<mint>> mul(vector<vector<mint>> a, vector<vector<mint>> b)
{
	int i, j, k;
	mint t;
	int n = a.size(), m = b[0].size(), l = a[0].size();
	vector<vector<mint>> c(n,vector<mint>(m));
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < m; j++)
		{
			t = 0;
			for (k = 0; k < l; k++)
				t += a[i][k] * b[k][j];
			c[i][j] = t;
		}
	}
	return c;
}

vector<vector<mint>> mat_pow(vector<vector<mint>> x, ll n)
{
	ll k = x.size();
	vector<vector<mint>> ans(k, vector<mint>(k, 0));
	for (int i = 0; i < k; i++)
		ans[i][i] = 1;
	while (n != 0)
	{
		if (n & 1)
			ans = mul(ans, x);
		x = mul(x, x);
		n = n >> 1;
	}
	return ans;
}

template <typename Monoid>
struct SegmentTree
{
	using F = function<Monoid(Monoid, Monoid)>;

	int sz;
	vector<Monoid> seg;

	const F f;
	const Monoid M1;

	SegmentTree(int n, const F f, const Monoid &M1) : f(f), M1(M1)
	{
		sz = 1;
		while (sz < n)
			sz <<= 1;
		seg.assign(2 * sz, M1);
	}

	void set(int k, const Monoid &x)
	{
		seg[k + sz] = x;
	}

	void build()
	{
		for (int k = sz - 1; k > 0; k--)
		{
			seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
		}
	}

	void update(int k, const Monoid &x)
	{
		k += sz;
		seg[k] = x;
		while (k >>= 1)
		{
			seg[k] = f(seg[2 * k + 0], seg[2 * k + 1]);
		}
	}

	Monoid query(int a, int b)
	{
		Monoid L = M1, R = M1;
		for (a += sz, b += sz; a < b; a >>= 1, b >>= 1)
		{
			if (a & 1)
				L = f(L, seg[a++]);
			if (b & 1)
				R = f(seg[--b], R);
		}
		return f(L, R);
	}

	Monoid operator[](const int &k) const
	{
		return seg[k + sz];
	}

	template <typename C>
	int find_subtree(int a, const C &check, Monoid &M, bool type)
	{
		while (a < sz)
		{
			Monoid nxt = type ? f(seg[2 * a + type], M) : f(M, seg[2 * a + type]);
			if (check(nxt))
				a = 2 * a + type;
			else
				M = nxt, a = 2 * a + 1 - type;
		}
		return a - sz;
	}

	template <typename C>
	int find_first(int a, const C &check)
	{
		Monoid L = M1;
		if (a <= 0)
		{
			if (check(f(L, seg[1])))
				return find_subtree(1, check, L, false);
			return -1;
		}
		int b = sz;
		for (a += sz, b += sz; a < b; a >>= 1, b >>= 1)
		{
			if (a & 1)
			{
				Monoid nxt = f(L, seg[a]);
				if (check(nxt))
					return find_subtree(a, check, L, false);
				L = nxt;
				++a;
			}
		}
		return -1;
	}

	template <typename C>
	int find_last(int b, const C &check)
	{
		Monoid R = M1;
		if (b >= sz)
		{
			if (check(f(seg[1], R)))
				return find_subtree(1, check, R, true);
			return -1;
		}
		int a = sz;
		for (b += sz; a < b; a >>= 1, b >>= 1)
		{
			if (b & 1)
			{
				Monoid nxt = f(seg[--b], R);
				if (check(nxt))
					return find_subtree(b, check, R, true);
				R = nxt;
			}
		}
		return -1;
	}
};

template <unsigned mod>
struct RollingHash
{
	vector<unsigned> hashed, power;

	inline unsigned mul(unsigned a, unsigned b) const
	{
		unsigned long long x = (unsigned long long)a * b;
		unsigned xh = (unsigned)(x >> 32), xl = (unsigned)x, d, m;
		asm("divl %4; \n\t"
			: "=a"(d), "=d"(m)
			: "d"(xh), "a"(xl), "r"(mod));
		return m;
	}

	RollingHash(const string &s, unsigned base = 10007)
	{
		int sz = (int)s.size();
		hashed.assign(sz + 1, 0);
		power.assign(sz + 1, 0);
		power[0] = 1;
		for (int i = 0; i < sz; i++)
		{
			power[i + 1] = mul(power[i], base);
			hashed[i + 1] = mul(hashed[i], base) + s[i];
			if (hashed[i + 1] >= mod)
				hashed[i + 1] -= mod;
		}
	}

	unsigned get(int l, int r) const
	{
		unsigned ret = hashed[r] + mod - mul(hashed[l], power[r - l]);
		if (ret >= mod)
			ret -= mod;
		return ret;
	}

	unsigned connect(unsigned h1, int h2, int h2len) const
	{
		unsigned ret = mul(h1, power[h2len]) + h2;
		if (ret >= mod)
			ret -= mod;
		return ret;
	}

	int LCP(const RollingHash<mod> &b, int l1, int r1, int l2, int r2)
	{
		int len = min(r1 - l1, r2 - l2);
		int low = -1, high = len + 1;
		while (high - low > 1)
		{
			int mid = (low + high) / 2;
			if (get(l1, l1 + mid) == b.get(l2, l2 + mid))
				low = mid;
			else
				high = mid;
		}
		return (low);
	}
};

using RH = RollingHash<1000000007>;

template <typename T>
struct edge
{
	int src, to;
	T cost;

	edge(int to, T cost) : src(-1), to(to), cost(cost) {}

	edge(int src, int to, T cost) : src(src), to(to), cost(cost) {}

	edge &operator=(const int &x)
	{
		to = x;
		return *this;
	}

	operator int() const { return to; }
};

template <typename T>
using Edges = vector<edge<T>>;
template <typename T>
using WeightedGraph = vector<Edges<T>>;
using UnWeightedGraph = vector<vector<int>>;
template <typename T>
using Matrix = vector<vector<T>>;

template <typename G>
struct DoublingLowestCommonAncestor
{
	const int LOG;
	vector<int> dep;
	const G &g;
	vector<vector<int>> table;

	DoublingLowestCommonAncestor(const G &g) : g(g), dep(g.size()), LOG(32 - __builtin_clz(g.size()))
	{
		table.assign(LOG, vector<int>(g.size(), -1));
	}

	void dfs(int idx, int par, int d)
	{
		table[0][idx] = par;
		dep[idx] = d;
		for (auto &to : g[idx])
		{
			if (to != par)
				dfs(to, idx, d + 1);
		}
	}

	void build()
	{
		dfs(0, -1, 0);
		for (int k = 0; k + 1 < LOG; k++)
		{
			for (int i = 0; i < table[k].size(); i++)
			{
				if (table[k][i] == -1)
					table[k + 1][i] = -1;
				else
					table[k + 1][i] = table[k][table[k][i]];
			}
		}
	}

	int query(int u, int v)
	{
		if (dep[u] > dep[v])
			swap(u, v);
		for (int i = LOG - 1; i >= 0; i--)
		{
			if (((dep[v] - dep[u]) >> i) & 1)
				v = table[i][v];
		}
		if (u == v)
			return u;
		for (int i = LOG - 1; i >= 0; i--)
		{
			if (table[i][u] != table[i][v])
			{
				u = table[i][u];
				v = table[i][v];
			}
		}
		return table[0][u];
	}
};

template <typename Monoid, typename OperatorMonoid = Monoid>
struct LazySegmentTree
{
	using F = function<Monoid(Monoid, Monoid)>;
	using G = function<Monoid(Monoid, OperatorMonoid)>;
	using H = function<OperatorMonoid(OperatorMonoid, OperatorMonoid)>;

	int sz, height;
	vector<Monoid> data;
	vector<OperatorMonoid> lazy;
	const F f;
	const G g;
	const H h;
	const Monoid M1;
	const OperatorMonoid OM0;

	LazySegmentTree(int n, const F f, const G g, const H h,
					const Monoid &M1, const OperatorMonoid OM0)
		: f(f), g(g), h(h), M1(M1), OM0(OM0)
	{
		sz = 1;
		height = 0;
		while (sz < n)
			sz <<= 1, height++;
		data.assign(2 * sz, M1);
		lazy.assign(2 * sz, OM0);
	}

	void set(int k, const Monoid &x)
	{
		data[k + sz] = x;
	}

	void build()
	{
		for (int k = sz - 1; k > 0; k--)
		{
			data[k] = f(data[2 * k + 0], data[2 * k + 1]);
		}
	}

	inline void propagate(int k)
	{
		if (lazy[k] != OM0)
		{
			lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
			lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
			data[k] = reflect(k);
			lazy[k] = OM0;
		}
	}

	inline Monoid reflect(int k)
	{
		return lazy[k] == OM0 ? data[k] : g(data[k], lazy[k]);
	}

	inline void recalc(int k)
	{
		while (k >>= 1)
			data[k] = f(reflect(2 * k + 0), reflect(2 * k + 1));
	}

	inline void thrust(int k)
	{
		for (int i = height; i > 0; i--)
			propagate(k >> i);
	}

	void update(int a, int b, const OperatorMonoid &x)
	{
		thrust(a += sz);
		thrust(b += sz - 1);
		for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1)
		{
			if (l & 1)
				lazy[l] = h(lazy[l], x), ++l;
			if (r & 1)
				--r, lazy[r] = h(lazy[r], x);
		}
		recalc(a);
		recalc(b);
	}

	Monoid query(int a, int b)
	{
		thrust(a += sz);
		thrust(b += sz - 1);
		Monoid L = M1, R = M1;
		for (int l = a, r = b + 1; l < r; l >>= 1, r >>= 1)
		{
			if (l & 1)
				L = f(L, reflect(l++));
			if (r & 1)
				R = f(reflect(--r), R);
		}
		return f(L, R);
	}

	Monoid operator[](const int &k)
	{
		return query(k, k + 1);
	}

	template <typename C>
	int find_subtree(int a, const C &check, Monoid &M, bool type)
	{
		while (a < sz)
		{
			propagate(a);
			Monoid nxt = type ? f(reflect(2 * a + type), M) : f(M, reflect(2 * a + type));
			if (check(nxt))
				a = 2 * a + type;
			else
				M = nxt, a = 2 * a + 1 - type;
		}
		return a - sz;
	}

	template <typename C>
	int find_first(int a, const C &check)
	{
		Monoid L = M1;
		if (a <= 0)
		{
			if (check(f(L, reflect(1))))
				return find_subtree(1, check, L, false);
			return -1;
		}
		thrust(a + sz);
		int b = sz;
		for (a += sz, b += sz; a < b; a >>= 1, b >>= 1)
		{
			if (a & 1)
			{
				Monoid nxt = f(L, reflect(a));
				if (check(nxt))
					return find_subtree(a, check, L, false);
				L = nxt;
				++a;
			}
		}
		return -1;
	}

	template <typename C>
	int find_last(int b, const C &check)
	{
		Monoid R = M1;
		if (b >= sz)
		{
			if (check(f(reflect(1), R)))
				return find_subtree(1, check, R, true);
			return -1;
		}
		thrust(b + sz - 1);
		int a = sz;
		for (b += sz; a < b; a >>= 1, b >>= 1)
		{
			if (b & 1)
			{
				Monoid nxt = f(reflect(--b), R);
				if (check(nxt))
					return find_subtree(b, check, R, true);
				R = nxt;
			}
		}
		return -1;
	}
};

template <typename T>
struct mat
{
	// 行列m
	vector<vector<T>> m;
	// コンストラクタ:第1引数⇒行数、第2引数⇒列数、第3引数⇒初期値
	mat() : m(vector<vector<T>>()) {}
	mat(int h, int w) : m(vector<vector<T>>(h, vector<T>(w))) {}
	mat(int h, int w, T d) : m(vector<vector<T>>(h, vector<T>(w, d))) {}
	// 添字演算子
	vector<T> operator[](const int i) const { return m[i]; } //読み取り
	vector<T> &operator[](const int i) { return m[i]; }		 //書き込み
	// 行数・列数
	int nrow = sz(m);
	int ncol = sz(m[0]);
	// 行列同士の演算
	mat &operator=(const mat &a) { return *a; }
	mat &operator+=(const mat &a)
	{
		assert(ncol == a.ncol && nrow == a.nrow);
		rep(i, nrow) rep(j, ncol) m[i][j] += a[i][j];
		return *this;
	}
	mat &operator-=(const mat &a)
	{
		assert(ncol == a.ncol && nrow == a.nrow);
		rep(i, nrow) rep(j, ncol) m[i][j] -= a[i][j];
		return *this;
	}
	mat &operator*=(const mat &a)
	{
		assert(ncol == a.nrow);
		mat<T> m2(nrow, a.ncol, 0);
		rep(i, nrow) rep(j, a.ncol) rep(k, ncol) m2[i][j] += m[i][k] * a[k][j];
		ncol = a.ncol;
		rep(i, nrow) m[i].resize(ncol);
		rep(i, nrow) rep(j, ncol) m[i][j] = m2[i][j];
		return *this;
	}
	mat operator+(const mat &a) const { return mat(*this) += a; }
	mat operator-(const mat &a) const { return mat(*this) -= a; }
	mat operator*(const mat &a) const { return mat(*this) *= a; }
	bool operator==(const mat &a)
	{
		assert(ncol == a.ncol && nrow == a.nrow);
		bool flg = true;
		rep(i, nrow) rep(j, ncol) if (m[i][j] != a[i][j]) flg = false;
		return flg;
	}
	// 行列とスカラの演算
	mat &operator+=(const T &a)
	{
		rep(i, nrow) rep(j, ncol) m[i][j] += a;
		return *this;
	}
	mat &operator-=(const T &a)
	{
		rep(i, nrow) rep(j, ncol) m[i][j] -= a;
		return *this;
	}
	mat &operator*=(const T &a)
	{
		rep(i, nrow) rep(j, ncol) m[i][j] *= a;
		return *this;
	}
	mat &operator/=(const T &a)
	{
		rep(i, nrow) rep(j, ncol) m[i][j] /= a;
		return *this;
	}
	mat operator+(const T &a) const { return mat(*this) += a; }
	mat operator-(const T &a) const { return mat(*this) -= a; }
	mat operator*(const T &a) const { return mat(*this) *= a; }
	mat operator/(const T &a) const { return mat(*this) /= a; }
	// 回転（degの数だけ時計回りに90度回転）
	mat &rot(int deg)
	{
		mat<T> m2(ncol, nrow);
		if (deg == 1 || deg == 3)
		{
			if (deg == 1)
				rep(i, nrow) rep(j, ncol) m2[j][nrow - i - 1] = m[i][j];
			if (deg == 3)
				rep(i, nrow) rep(j, ncol) m2[ncol - j - 1][i] = m[i][j];
			swap(ncol, nrow); // 列数と行数を入れ替える
			m.resize(nrow);
			rep(i, nrow) m[i].resize(ncol); //リサイズ
		}
		if (deg == 2)
			rep(i, nrow) rep(j, ncol) m2[nrow - i - 1][ncol - j - 1] = m[i][j];
		rep(i, nrow) rep(j, ncol) m[i][j] = m2[i][j];
		return *this;
	}
	// 標準出力
	void show()
	{
		rep(i, nrow) rep(j, ncol)
		{
			if (j != 0)
				cout << " ";
			cout << m[i][j];
			if (j == ncol - 1)
				cout << endl;
		}
		return;
	}
};

int main()
{
	M = 998244353;
	ll n, k, p[222222];
	cin >> n >> k;
	rep(i, n) cin >> p[i];
	ll r = k - 1;
	r *= modinv(k);
	mint ans = k * (k - 1);
	ans /= 4;
	mat<mint> v(3,3,0);
	v[0][2] = 1;
	v[1][2] = 1;
	v[2][2] = 1;
	mat<mint> u(3,3,0);
	u[0][0] = 1;
	u[1][1] = r;
	u[2][2] = 1;
	mat<mint> t(3,3,0);
	t[0][0] = 1;
	t[1][1] = 1;
	t[2][2] = 1;
	mat<mint> z(1, 3, 0);
	z[0][2] = 1;
	mat<mint> o(1, 3, 1);
	function<mat<mint>(mat<mint>, mat<mint>)> f = [](mat<mint> a, mat<mint> b) { return a + b; };
	function<mat<mint>(mat<mint>, mat<mint>)> g = [](mat<mint> a, mat<mint> x) { return x * a; };
	function<mat<mint>(mat<mint>, mat<mint>)> h = [](mat<mint> v1, mat<mint> v2) { return v2 * v1; };
	LazySegmentTree<mat<mint>, mat<mint>> seg(n + 1, f, g, h, z, t);
	rep(i, k) seg.set(p[i], o);
	seg.build();
	for (int i = 1; i < n - k + 1; i++){
		ans += (k - 1) * modinv(2);
		seg.update(0, n + 1, u);
		mat<mint> ret = seg.query(p[i + k - 1], n + 1);
		ans += ret[0][0];
		ans -= ret[0][1];
		seg.update(p[i + k - 1], p[i + k - 1] + 1, v);
	}
	cout << ans << endl;
}

Compiler output:
a.cc: In instantiation of 'mat<T>::mat(int, int, T) [with T = ModInt<998244353>]':
a.cc:857:19:   required from here
  857 |         mat<mint> v(3,3,0);
      |                          ^
a.cc:752:22: error: 'sz' was not declared in this scope
  752 |         int nrow = sz(m);
      |                    ~~^~~
a.cc:753:22: error: 'sz' was not declared in this scope
  753 |         int ncol = sz(m[0]);
      |                    ~~^~~~~~
a.cc: In instantiation of 'mat<T>& mat<T>::operator=(const mat<T>&) [with T = ModInt<998244353>]':
a.cc:598:16:   required from 'void LazySegmentTree<Monoid, OperatorMonoid>::set(int, const Monoid&) [with Monoid = mat<ModInt<998244353> >; OperatorMonoid = mat<ModInt<998244353> >]'
  598 |                 data[k + sz] = x;
      |                 ~~~~~~~~~~~~~^~~
a.cc:876:19:   required from here
  876 |         rep(i, k) seg.set(p[i], o);
      |                   ~~~~~~~^~~~~~~~~
a.cc:755:47: error: no match for 'operator*' (operand type is 'const mat<ModInt<998244353> >')
  755 |         mat &operator=(const mat &a) { return *a; }
      |                                               ^~
a.cc:780:13: note: candidate: 'mat<T> mat<T>::operator*(const mat<T>&) const [with T = ModInt<998244353>]'
  780 |         mat operator*(const mat &a) const { return mat(*this) *= a; }
      |             ^~~~~~~~
a.cc:780:13: note:   candidate expects 1 argument, 0 provided
a.cc:811:13: note: candidate: 'mat<T> mat<T>::operator*(const T&) const [with T = ModInt<998244353>]'
  811 |         mat operator*(const T &a) const { return mat(*this) *= a; }
      |             ^~~~~~~~
a.cc:811:13: note:   candidate expects 1 argument, 0 provided
In file included from /usr/include/c++/14/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:127,
                 from a.cc:1:
/usr/include/c++/14/complex:400:5: note: candidate: 'template<class _Tp> std::complex<_Tp> std::operator*(const complex<_Tp>&, const complex<_Tp>&)'
  400 |     operator*(const complex<_Tp>& __x, const complex<_Tp>& __y)
      |     ^~~~~~~~
/usr/include/c++/14/complex:400:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/complex:409:5: note: candidate: 'template<class _Tp> std::complex<_Tp> std::operator*(const complex<_Tp>&, const _Tp&)'
  409 |     operator*(const complex<_Tp>& __x, const _Tp& __y)
      |     ^~~~~~~~
/usr/include/c++/14/complex:409:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/complex:418:5: note: candidate: 'template<class _Tp> std::complex<_Tp> std::operator*(const _Tp&, const complex<_Tp>&)'
  418 |     operator*(const _Tp& __x, const complex<_Tp>& __y)
      |     ^~~~~~~~
/usr/include/c++/14/complex:418:5: note:   candidate expects 2 arguments, 1 provided
In file included from /usr/include/c++/14/valarray:605,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:166:
/usr/include/c++/14/bits/valarray_after.h:407:5: note: candidate: 'template<class _Dom1, class _Dom2> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_Expr, std::_Expr, _Dom1, _Dom2>, typename std::__fun<std::__multiplies, typename _Dom1::value_type>::result_type> std::operator*(const _Expr<_Dom1, typename _Dom1::value_type>&, const _Expr<_Dom2, typename _Dom2::value_type>&)'
  407 |     _DEFINE_EXPR_BINARY_OPERATOR(*, struct std::__multiplies)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:407:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/valarray_after.h:407:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_Expr, std::_Constant, _Dom, typename _Dom::value_type>, typename std::__fun<std::__multiplies, typename _Dom1::value_type>::result_type> std::operator*(const _Expr<_Dom1, typename _Dom1::value_type>&, const typename _Dom::value_type&)'
  407 |     _DEFINE_EXPR_BINARY_OPERATOR(*, struct std::__multiplies)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:407:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/valarray_after.h:407:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_Constant, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__multiplies, typename _Dom1::value_type>::result_type> std::operator*(const typename _Dom::value_type&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
  407 |     _DEFINE_EXPR_BINARY_OPERATOR(*, struct std::__multiplies)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:407:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/valarray_after.h:407:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_Expr, std::_ValArray, _Dom, typename _Dom::value_type>, typename std::__fun<std::__multiplies, typename _Dom1::value_type>::result_type> std::operator*(const _Expr<_Dom1, typename _Dom1::value_type>&, const valarray<typename _Dom::value_type>&)'
  407 |     _DEFINE_EXPR_BINARY_OPERATOR(*, struct std::__multiplies)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:407:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/bits/valarray_after.h:407:5: note: candidate: 'template<class _Dom> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_ValArray, std::_Expr, typename _Dom::value_type, _Dom>, typename std::__fun<std::__multiplies, typename _Dom1::value_type>::result_type> std::operator*(const valarray<typename _Dom::value_type>&, const _Expr<_Dom1, typename _Dom1::value_type>&)'
  407 |     _DEFINE_EXPR_BINARY_OPERATOR(*, struct std::__multiplies)
      |     ^~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/bits/valarray_after.h:407:5: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/valarray:1198:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_ValArray, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__multiplies, _Tp>::result_type> std::operator*(const valarray<_Tp>&, const valarray<_Tp>&)'
 1198 | _DEFINE_BINARY_OPERATOR(*, __multiplies)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/valarray:1198:1: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/valarray:1198:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_ValArray, std::_Constant, _Tp, _Tp>, typename std::__fun<std::__multiplies, _Tp>::result_type> std::operator*(const valarray<_Tp>&, const typename valarray<_Tp>::value_type&)'
 1198 | _DEFINE_BINARY_OPERATOR(*, __multiplies)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/valarray:1198:1: note:   candidate expects 2 arguments, 1 provided
/usr/include/c++/14/valarray:1198:1: note: candidate: 'template<class _Tp> std::_Expr<std::__detail::_BinClos<std::__multiplies, std::_Constant, std::_ValArray, _Tp, _Tp>, typename std::__fun<std::__multiplies, _Tp>::result_type> std::operator*(const typename valarray<_Tp>::value_type&, const valarray<_Tp>&)'
 1198 | _DEFINE_BINARY_OPERATOR(*, __multiplies)
      | ^~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/14/valarray:1198:1: note:   candidate expects 2 arguments, 1 provided
a.cc: In instantiation of 'void LazySegmentTree<Monoid, OperatorMonoid>::propagate(int) [with Monoid = mat<ModInt<998244353> >; OperatorMonoid = mat<ModInt<998244353> >]':
a.cc:634:4:   required from 'void LazySegmentTree<Monoid, OperatorMonoid>::thrust(int) [with Monoid = mat<ModInt<998244353> >; OperatorMonoid = mat<ModInt<998244353> >]'
  634 |                         propagate(k >> i);
      |                         ^~~~~~~~~
a.cc:639:3:   required from 'void LazySegmentTree<Monoid, OperatorMonoid>::update(int, int, const OperatorMonoid&) [with Monoid = mat<ModInt<998244353> >; OperatorMonoid = mat<ModInt<998244353> >]'
  639 |                 thrust(a += sz);
      |                 ^~~~~~
a.cc:880:13:   required from here
  880 |                 seg.update(0, n + 1, u);
      |                 ~~~~~~~~~~^~~~~~~~~~~~~
a.cc:611:29: error: no match for 'operator!=' (operand types are '__gnu_cxx::__alloc_traits<std::allocator<mat<ModInt<998244353> > >, mat<ModInt<998244353> > >::value_type' {aka 'mat<ModInt<998244353> >'} and 'const mat<ModInt<998244353> >')
  611 |                 if (lazy[k] != OM0)
      |                     ~~~~~~~~^~~~~~
In file included from /usr/include/c++/14/regex:68,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:181:
/usr/include/c++/14/bits/regex.h:1132:5: note: candidate: 'template<class _BiIter> bool std::__cxx11::operator!=(const sub_match<_BiIter>&, const sub_match<_BiIter>&)'
 1132 |     operator!=(const sub_match<_BiIter>& __lhs, const sub_match<_BiIter>& __rhs)
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1132:5: note:   template argument deduction/substitution failed:
a.cc:611:29: note:   '__gnu_cxx::__alloc_traits<std::allocator<mat<ModInt<998244353> > >, mat<ModInt<998244353> > >::value_type' {aka 'mat<ModInt<998244353> >'} is not derived from 'const std::__cxx11::sub_match<_BiIter>'
  611 |                 if (lazy[k] != OM0)
      |                     ~~~~~~~~^~~~~~
/usr/include/c++/14/bits/regex.h:1212:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator!=(__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>&, const sub_match<_BiIter>&)'
 1212 |     operator!=(const __sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>& __lhs,
      |     ^~~~~~~~
/usr/include/c++/14/bits/regex.h:1212:5: note:   template argument deduction/substitution failed:
a.cc:611:29: note:   '__gnu_cxx::__alloc_traits<std::allocator<mat<ModInt<998244353> > >, mat<ModInt<998244353> > >::value_type' {aka 'mat<ModInt<998244353> >'} is not derived from 'std::__cxx11::__sub_match_string<_Bi_iter, _Ch_traits, _Ch_alloc>'
  611 |                 if (lazy[k] != OM0)
      |                     ~~~~~~~~^~~~~~
/usr/include/c++/14/bits/regex.h:1305:5: note: candidate: 'template<class _Bi_iter, class _Ch_traits, class _Ch_alloc> bool std::__cxx11::operator!=(