結果
問題 | No.2626 Similar But Different Name |
ユーザー | maspy |
提出日時 | 2024-02-09 21:47:04 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 101 ms / 3,000 ms |
コード長 | 29,460 bytes |
コンパイル時間 | 5,186 ms |
コンパイル使用メモリ | 336,756 KB |
実行使用メモリ | 28,016 KB |
最終ジャッジ日時 | 2024-09-28 15:01:49 |
合計ジャッジ時間 | 8,169 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,820 KB |
testcase_01 | AC | 1 ms
6,820 KB |
testcase_02 | AC | 2 ms
6,820 KB |
testcase_03 | AC | 1 ms
6,816 KB |
testcase_04 | AC | 2 ms
6,820 KB |
testcase_05 | AC | 2 ms
6,816 KB |
testcase_06 | AC | 1 ms
6,816 KB |
testcase_07 | AC | 2 ms
6,816 KB |
testcase_08 | AC | 2 ms
6,820 KB |
testcase_09 | AC | 1 ms
6,820 KB |
testcase_10 | AC | 2 ms
6,820 KB |
testcase_11 | AC | 2 ms
6,816 KB |
testcase_12 | AC | 2 ms
6,816 KB |
testcase_13 | AC | 2 ms
6,816 KB |
testcase_14 | AC | 3 ms
6,816 KB |
testcase_15 | AC | 2 ms
6,820 KB |
testcase_16 | AC | 2 ms
6,816 KB |
testcase_17 | AC | 2 ms
6,816 KB |
testcase_18 | AC | 31 ms
28,016 KB |
testcase_19 | AC | 30 ms
19,720 KB |
testcase_20 | AC | 28 ms
19,864 KB |
testcase_21 | AC | 27 ms
19,636 KB |
testcase_22 | AC | 98 ms
25,728 KB |
testcase_23 | AC | 99 ms
25,904 KB |
testcase_24 | AC | 100 ms
24,204 KB |
testcase_25 | AC | 96 ms
24,728 KB |
testcase_26 | AC | 98 ms
25,952 KB |
testcase_27 | AC | 100 ms
26,004 KB |
testcase_28 | AC | 98 ms
25,280 KB |
testcase_29 | AC | 100 ms
24,220 KB |
testcase_30 | AC | 97 ms
24,872 KB |
testcase_31 | AC | 101 ms
25,544 KB |
testcase_32 | AC | 99 ms
25,948 KB |
testcase_33 | AC | 99 ms
25,888 KB |
testcase_34 | AC | 99 ms
24,240 KB |
testcase_35 | AC | 96 ms
25,596 KB |
testcase_36 | AC | 94 ms
24,260 KB |
testcase_37 | AC | 30 ms
28,016 KB |
ソースコード
#line 1 "/home/maspy/compro/library/my_template.hpp"#if defined(LOCAL)#include <my_template_compiled.hpp>#else// 参考 https://codeforces.com/blog/entry/96344// bmi,bmi2,lzcnt は ucup でコンパイルエラー#pragma GCC optimize("Ofast,unroll-loops")#pragma GCC target("avx2,popcnt")#include <bits/stdc++.h>using namespace std;using ll = long long;using u32 = unsigned int;using u64 = unsigned long long;using i128 = __int128;using u128 = unsigned __int128;using f128 = __float128;template <class T>constexpr T infty = 0;template <>constexpr int infty<int> = 1'000'000'000;template <>constexpr ll infty<ll> = ll(infty<int>) * infty<int> * 2;template <>constexpr u32 infty<u32> = infty<int>;template <>constexpr u64 infty<u64> = infty<ll>;template <>constexpr i128 infty<i128> = i128(infty<ll>) * infty<ll>;template <>constexpr double infty<double> = infty<ll>;template <>constexpr long double infty<long double> = infty<ll>;using pi = pair<ll, ll>;using vi = vector<ll>;template <class T>using vc = vector<T>;template <class T>using vvc = vector<vc<T>>;template <class T>using vvvc = vector<vvc<T>>;template <class T>using vvvvc = vector<vvvc<T>>;template <class T>using vvvvvc = vector<vvvvc<T>>;template <class T>using pq = priority_queue<T>;template <class T>using pqg = priority_queue<T, vector<T>, greater<T>>;#define vv(type, name, h, ...) \vector<vector<type>> name(h, vector<type>(__VA_ARGS__))#define vvv(type, name, h, w, ...) \vector<vector<vector<type>>> name( \h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))#define vvvv(type, name, a, b, c, ...) \vector<vector<vector<vector<type>>>> name( \a, vector<vector<vector<type>>>( \b, vector<vector<type>>(c, vector<type>(__VA_ARGS__))))// https://trap.jp/post/1224/#define FOR1(a) for (ll _ = 0; _ < ll(a); ++_)#define FOR2(i, a) for (ll i = 0; i < ll(a); ++i)#define FOR3(i, a, b) for (ll i = a; i < ll(b); ++i)#define FOR4(i, a, b, c) for (ll i = a; i < ll(b); i += (c))#define FOR1_R(a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR2_R(i, a) for (ll i = (a)-1; i >= ll(0); --i)#define FOR3_R(i, a, b) for (ll i = (b)-1; i >= ll(a); --i)#define overload4(a, b, c, d, e, ...) e#define overload3(a, b, c, d, ...) d#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)#define FOR_R(...) overload3(__VA_ARGS__, FOR3_R, FOR2_R, FOR1_R)(__VA_ARGS__)#define FOR_subset(t, s) \for (ll t = (s); t >= 0; t = (t == 0 ? -1 : (t - 1) & (s)))#define all(x) x.begin(), x.end()#define len(x) ll(x.size())#define elif else if#define eb emplace_back#define mp make_pair#define mt make_tuple#define fi first#define se second#define stoi stollint popcnt(int x) { return __builtin_popcount(x); }int popcnt(u32 x) { return __builtin_popcount(x); }int popcnt(ll x) { return __builtin_popcountll(x); }int popcnt(u64 x) { return __builtin_popcountll(x); }int popcnt_mod_2(int x) { return __builtin_parity(x); }int popcnt_mod_2(u32 x) { return __builtin_parity(x); }int popcnt_mod_2(ll x) { return __builtin_parityll(x); }int popcnt_mod_2(u64 x) { return __builtin_parityll(x); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 1, 2)int topbit(int x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(u32 x) { return (x == 0 ? -1 : 31 - __builtin_clz(x)); }int topbit(ll x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }int topbit(u64 x) { return (x == 0 ? -1 : 63 - __builtin_clzll(x)); }// (0, 1, 2, 3, 4) -> (-1, 0, 1, 0, 2)int lowbit(int x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(u32 x) { return (x == 0 ? -1 : __builtin_ctz(x)); }int lowbit(ll x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }int lowbit(u64 x) { return (x == 0 ? -1 : __builtin_ctzll(x)); }template <typename T>T floor(T a, T b) {return a / b - (a % b && (a ^ b) < 0);}template <typename T>T ceil(T x, T y) {return floor(x + y - 1, y);}template <typename T>T bmod(T x, T y) {return x - y * floor(x, y);}template <typename T>pair<T, T> divmod(T x, T y) {T q = floor(x, y);return {q, x - q * y};}template <typename T, typename U>T SUM(const vector<U> &A) {T sm = 0;for (auto &&a: A) sm += a;return sm;}#define MIN(v) *min_element(all(v))#define MAX(v) *max_element(all(v))#define LB(c, x) distance((c).begin(), lower_bound(all(c), (x)))#define UB(c, x) distance((c).begin(), upper_bound(all(c), (x)))#define UNIQUE(x) \sort(all(x)), x.erase(unique(all(x)), x.end()), x.shrink_to_fit()template <typename T>T POP(deque<T> &que) {T a = que.front();que.pop_front();return a;}template <typename T>T POP(pq<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(pqg<T> &que) {T a = que.top();que.pop();return a;}template <typename T>T POP(vc<T> &que) {T a = que.back();que.pop_back();return a;}template <typename F>ll binary_search(F check, ll ok, ll ng, bool check_ok = true) {if (check_ok) assert(check(ok));while (abs(ok - ng) > 1) {auto x = (ng + ok) / 2;(check(x) ? ok : ng) = x;}return ok;}template <typename F>double binary_search_real(F check, double ok, double ng, int iter = 100) {FOR(iter) {double x = (ok + ng) / 2;(check(x) ? ok : ng) = x;}return (ok + ng) / 2;}template <class T, class S>inline bool chmax(T &a, const S &b) {return (a < b ? a = b, 1 : 0);}template <class T, class S>inline bool chmin(T &a, const S &b) {return (a > b ? a = b, 1 : 0);}// ? は -1vc<int> s_to_vi(const string &S, char first_char) {vc<int> A(S.size());FOR(i, S.size()) { A[i] = (S[i] != '?' ? S[i] - first_char : -1); }return A;}template <typename T, typename U>vector<T> cumsum(vector<U> &A, int off = 1) {int N = A.size();vector<T> B(N + 1);FOR(i, N) { B[i + 1] = B[i] + A[i]; }if (off == 0) B.erase(B.begin());return B;}// stable sorttemplate <typename T>vector<int> argsort(const vector<T> &A) {vector<int> ids(len(A));iota(all(ids), 0);sort(all(ids),[&](int i, int j) { return (A[i] == A[j] ? i < j : A[i] < A[j]); });return ids;}// A[I[0]], A[I[1]], ...template <typename T>vc<T> rearrange(const vc<T> &A, const vc<int> &I) {vc<T> B(len(I));FOR(i, len(I)) B[i] = A[I[i]];return B;}#endif#line 1 "/home/maspy/compro/library/other/io.hpp"#define FASTIO#include <unistd.h>// https://judge.yosupo.jp/submission/21623namespace fastio {static constexpr uint32_t SZ = 1 << 17;char ibuf[SZ];char obuf[SZ];char out[100];// pointer of ibuf, obufuint32_t pil = 0, pir = 0, por = 0;struct Pre {char num[10000][4];constexpr Pre() : num() {for (int i = 0; i < 10000; i++) {int n = i;for (int j = 3; j >= 0; j--) {num[i][j] = n % 10 | '0';n /= 10;}}}} constexpr pre;inline void load() {memcpy(ibuf, ibuf + pil, pir - pil);pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);pil = 0;if (pir < SZ) ibuf[pir++] = '\n';}inline void flush() {fwrite(obuf, 1, por, stdout);por = 0;}void rd(char &c) {do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));}void rd(string &x) {x.clear();char c;do {if (pil + 1 > pir) load();c = ibuf[pil++];} while (isspace(c));do {x += c;if (pil == pir) load();c = ibuf[pil++];} while (!isspace(c));}template <typename T>void rd_real(T &x) {string s;rd(s);x = stod(s);}template <typename T>void rd_integer(T &x) {if (pil + 100 > pir) load();char c;doc = ibuf[pil++];while (c < '-');bool minus = 0;if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (c == '-') { minus = 1, c = ibuf[pil++]; }}x = 0;while ('0' <= c) { x = x * 10 + (c & 15), c = ibuf[pil++]; }if constexpr (is_signed<T>::value || is_same_v<T, i128>) {if (minus) x = -x;}}void rd(int &x) { rd_integer(x); }void rd(ll &x) { rd_integer(x); }void rd(i128 &x) { rd_integer(x); }void rd(u32 &x) { rd_integer(x); }void rd(u64 &x) { rd_integer(x); }void rd(u128 &x) { rd_integer(x); }void rd(double &x) { rd_real(x); }void rd(long double &x) { rd_real(x); }void rd(f128 &x) { rd_real(x); }template <class T, class U>void rd(pair<T, U> &p) {return rd(p.first), rd(p.second);}template <size_t N = 0, typename T>void rd_tuple(T &t) {if constexpr (N < std::tuple_size<T>::value) {auto &x = std::get<N>(t);rd(x);rd_tuple<N + 1>(t);}}template <class... T>void rd(tuple<T...> &tpl) {rd_tuple(tpl);}template <size_t N = 0, typename T>void rd(array<T, N> &x) {for (auto &d: x) rd(d);}template <class T>void rd(vc<T> &x) {for (auto &d: x) rd(d);}void read() {}template <class H, class... T>void read(H &h, T &... t) {rd(h), read(t...);}void wt(const char c) {if (por == SZ) flush();obuf[por++] = c;}void wt(const string s) {for (char c: s) wt(c);}void wt(const char *s) {size_t len = strlen(s);for (size_t i = 0; i < len; i++) wt(s[i]);}template <typename T>void wt_integer(T x) {if (por > SZ - 100) flush();if (x < 0) { obuf[por++] = '-', x = -x; }int outi;for (outi = 96; x >= 10000; outi -= 4) {memcpy(out + outi, pre.num[x % 10000], 4);x /= 10000;}if (x >= 1000) {memcpy(obuf + por, pre.num[x], 4);por += 4;} else if (x >= 100) {memcpy(obuf + por, pre.num[x] + 1, 3);por += 3;} else if (x >= 10) {int q = (x * 103) >> 10;obuf[por] = q | '0';obuf[por + 1] = (x - q * 10) | '0';por += 2;} elseobuf[por++] = x | '0';memcpy(obuf + por, out + outi + 4, 96 - outi);por += 96 - outi;}template <typename T>void wt_real(T x) {ostringstream oss;oss << fixed << setprecision(15) << double(x);string s = oss.str();wt(s);}void wt(int x) { wt_integer(x); }void wt(ll x) { wt_integer(x); }void wt(i128 x) { wt_integer(x); }void wt(u32 x) { wt_integer(x); }void wt(u64 x) { wt_integer(x); }void wt(u128 x) { wt_integer(x); }void wt(double x) { wt_real(x); }void wt(long double x) { wt_real(x); }void wt(f128 x) { wt_real(x); }template <class T, class U>void wt(const pair<T, U> val) {wt(val.first);wt(' ');wt(val.second);}template <size_t N = 0, typename T>void wt_tuple(const T t) {if constexpr (N < std::tuple_size<T>::value) {if constexpr (N > 0) { wt(' '); }const auto x = std::get<N>(t);wt(x);wt_tuple<N + 1>(t);}}template <class... T>void wt(tuple<T...> tpl) {wt_tuple(tpl);}template <class T, size_t S>void wt(const array<T, S> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}template <class T>void wt(const vector<T> val) {auto n = val.size();for (size_t i = 0; i < n; i++) {if (i) wt(' ');wt(val[i]);}}void print() { wt('\n'); }template <class Head, class... Tail>void print(Head &&head, Tail &&... tail) {wt(head);if (sizeof...(Tail)) wt(' ');print(forward<Tail>(tail)...);}// gcc expansion. called automaticall after main.void __attribute__((destructor)) _d() { flush(); }} // namespace fastiousing fastio::read;using fastio::print;using fastio::flush;#define INT(...) \int __VA_ARGS__; \read(__VA_ARGS__)#define LL(...) \ll __VA_ARGS__; \read(__VA_ARGS__)#define U32(...) \u32 __VA_ARGS__; \read(__VA_ARGS__)#define U64(...) \u64 __VA_ARGS__; \read(__VA_ARGS__)#define STR(...) \string __VA_ARGS__; \read(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \read(__VA_ARGS__)#define DBL(...) \double __VA_ARGS__; \read(__VA_ARGS__)#define VEC(type, name, size) \vector<type> name(size); \read(name)#define VV(type, name, h, w) \vector<vector<type>> name(h, vector<type>(w)); \read(name)void YES(bool t = 1) { print(t ? "YES" : "NO"); }void NO(bool t = 1) { YES(!t); }void Yes(bool t = 1) { print(t ? "Yes" : "No"); }void No(bool t = 1) { Yes(!t); }void yes(bool t = 1) { print(t ? "yes" : "no"); }void no(bool t = 1) { yes(!t); }#line 3 "main.cpp"#line 2 "/home/maspy/compro/library/mod/modint_common.hpp"struct has_mod_impl {template <class T>static auto check(T &&x) -> decltype(x.get_mod(), std::true_type{});template <class T>static auto check(...) -> std::false_type;};template <class T>class has_mod : public decltype(has_mod_impl::check<T>(std::declval<T>())) {};template <typename mint>mint inv(int n) {static const int mod = mint::get_mod();static vector<mint> dat = {0, 1};assert(0 <= n);if (n >= mod) n %= mod;while (len(dat) <= n) {int k = len(dat);int q = (mod + k - 1) / k;dat.eb(dat[k * q - mod] * mint::raw(q));}return dat[n];}template <typename mint>mint fact(int n) {static const int mod = mint::get_mod();assert(0 <= n && n < mod);static vector<mint> dat = {1, 1};while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * mint::raw(len(dat)));return dat[n];}template <typename mint>mint fact_inv(int n) {static vector<mint> dat = {1, 1};if (n < 0) return mint(0);while (len(dat) <= n) dat.eb(dat[len(dat) - 1] * inv<mint>(len(dat)));return dat[n];}template <class mint, class... Ts>mint fact_invs(Ts... xs) {return (mint(1) * ... * fact_inv<mint>(xs));}template <typename mint, class Head, class... Tail>mint multinomial(Head &&head, Tail &&... tail) {return fact<mint>(head) * fact_invs<mint>(std::forward<Tail>(tail)...);}template <typename mint>mint C_dense(int n, int k) {static vvc<mint> C;static int H = 0, W = 0;auto calc = [&](int i, int j) -> mint {if (i == 0) return (j == 0 ? mint(1) : mint(0));return C[i - 1][j] + (j ? C[i - 1][j - 1] : 0);};if (W <= k) {FOR(i, H) {C[i].resize(k + 1);FOR(j, W, k + 1) { C[i][j] = calc(i, j); }}W = k + 1;}if (H <= n) {C.resize(n + 1);FOR(i, H, n + 1) {C[i].resize(W);FOR(j, W) { C[i][j] = calc(i, j); }}H = n + 1;}return C[n][k];}template <typename mint, bool large = false, bool dense = false>mint C(ll n, ll k) {assert(n >= 0);if (k < 0 || n < k) return 0;if constexpr (dense) return C_dense<mint>(n, k);if constexpr (!large) return multinomial<mint>(n, k, n - k);k = min(k, n - k);mint x(1);FOR(i, k) x *= mint(n - i);return x * fact_inv<mint>(k);}template <typename mint, bool large = false>mint C_inv(ll n, ll k) {assert(n >= 0);assert(0 <= k && k <= n);if (!large) return fact_inv<mint>(n) * fact<mint>(k) * fact<mint>(n - k);return mint(1) / C<mint, 1>(n, k);}// [x^d](1-x)^{-n}template <typename mint, bool large = false, bool dense = false>mint C_negative(ll n, ll d) {assert(n >= 0);if (d < 0) return mint(0);if (n == 0) { return (d == 0 ? mint(1) : mint(0)); }return C<mint, large, dense>(n + d - 1, d);}#line 3 "/home/maspy/compro/library/mod/modint.hpp"template <int mod>struct modint {static constexpr u32 umod = u32(mod);static_assert(umod < u32(1) << 31);u32 val;static modint raw(u32 v) {modint x;x.val = v;return x;}constexpr modint() : val(0) {}constexpr modint(u32 x) : val(x % umod) {}constexpr modint(u64 x) : val(x % umod) {}constexpr modint(u128 x) : val(x % umod) {}constexpr modint(int x) : val((x %= mod) < 0 ? x + mod : x){};constexpr modint(ll x) : val((x %= mod) < 0 ? x + mod : x){};constexpr modint(i128 x) : val((x %= mod) < 0 ? x + mod : x){};bool operator<(const modint &other) const { return val < other.val; }modint &operator+=(const modint &p) {if ((val += p.val) >= umod) val -= umod;return *this;}modint &operator-=(const modint &p) {if ((val += umod - p.val) >= umod) val -= umod;return *this;}modint &operator*=(const modint &p) {val = u64(val) * p.val % umod;return *this;}modint &operator/=(const modint &p) {*this *= p.inverse();return *this;}modint operator-() const { return modint::raw(val ? mod - val : u32(0)); }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 val == p.val; }bool operator!=(const modint &p) const { return val != p.val; }modint inverse() const {int a = val, 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(ll n) const {assert(n >= 0);modint ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul;n >>= 1;}return ret;}static constexpr int get_mod() { return mod; }// (n, r), r は 1 の 2^n 乗根static constexpr pair<int, int> ntt_info() {if (mod == 120586241) return {20, 74066978};if (mod == 167772161) return {25, 17};if (mod == 469762049) return {26, 30};if (mod == 754974721) return {24, 362};if (mod == 880803841) return {23, 211};if (mod == 943718401) return {22, 663003469};if (mod == 998244353) return {23, 31};if (mod == 1045430273) return {20, 363};if (mod == 1051721729) return {20, 330};if (mod == 1053818881) return {20, 2789};return {-1, -1};}static constexpr bool can_ntt() { return ntt_info().fi != -1; }};#ifdef FASTIOtemplate <int mod>void rd(modint<mod> &x) {fastio::rd(x.val);x.val %= mod;// assert(0 <= x.val && x.val < mod);}template <int mod>void wt(modint<mod> x) {fastio::wt(x.val);}#endifusing modint107 = modint<1000000007>;using modint998 = modint<998244353>;#line 2 "/home/maspy/compro/library/random/base.hpp"u64 RNG_64() {static uint64_t x_= uint64_t(chrono::duration_cast<chrono::nanoseconds>(chrono::high_resolution_clock::now().time_since_epoch()).count())* 10150724397891781847ULL;x_ ^= x_ << 7;return x_ ^= x_ >> 9;}u64 RNG(u64 lim) { return RNG_64() % lim; }ll RNG(ll l, ll r) { return l + RNG_64() % (r - l); }#line 2 "/home/maspy/compro/library/mod/modint61.hpp"struct modint61 {static constexpr u64 mod = (1ULL << 61) - 1;u64 val;constexpr modint61() : val(0ULL) {}constexpr modint61(u32 x) : val(x) {}constexpr modint61(u64 x) : val(x % mod) {}constexpr modint61(int x) : val((x < 0) ? (x + static_cast<ll>(mod)) : x) {}constexpr modint61(ll x): val(((x %= static_cast<ll>(mod)) < 0) ? (x + static_cast<ll>(mod)): x) {}static constexpr u64 get_mod() { return mod; }modint61 &operator+=(const modint61 &a) {val = ((val += a.val) >= mod) ? (val - mod) : val;return *this;}modint61 &operator-=(const modint61 &a) {val = ((val -= a.val) >= mod) ? (val + mod) : val;return *this;}modint61 &operator*=(const modint61 &a) {const unsigned __int128 y = static_cast<unsigned __int128>(val) * a.val;val = (y >> 61) + (y & mod);val = (val >= mod) ? (val - mod) : val;return *this;}modint61 operator-() const { return modint61(val ? mod - val : u64(0)); }modint61 &operator/=(const modint61 &a) { return (*this *= a.inverse()); }modint61 operator+(const modint61 &p) const { return modint61(*this) += p; }modint61 operator-(const modint61 &p) const { return modint61(*this) -= p; }modint61 operator*(const modint61 &p) const { return modint61(*this) *= p; }modint61 operator/(const modint61 &p) const { return modint61(*this) /= p; }bool operator==(const modint61 &p) const { return val == p.val; }bool operator!=(const modint61 &p) const { return val != p.val; }modint61 inverse() const {ll a = val, b = mod, u = 1, v = 0, t;while (b > 0) {t = a / b;swap(a -= t * b, b), swap(u -= t * v, v);}return modint61(u);}modint61 pow(ll n) const {assert(n >= 0);modint61 ret(1), mul(val);while (n > 0) {if (n & 1) ret *= mul;mul *= mul, n >>= 1;}return ret;}};#ifdef FASTIOvoid rd(modint61 &x) {fastio::rd(x.val);assert(0 <= x.val && x.val < modint61::mod);}void wt(modint61 x) { fastio::wt(x.val); }#endif#line 4 "/home/maspy/compro/library/string/rollinghash.hpp"struct RollingHash {using mint = modint61;static constexpr u64 mod = mint::get_mod();const mint base;vc<mint> power;static inline mint generate_base() { return RNG(mod); }inline void expand(size_t sz) {if (power.size() < sz + 1) {int pre_sz = (int)power.size();power.resize(sz + 1);FOR(i, pre_sz - 1, sz) power[i + 1] = power[i] * base;}}explicit RollingHash(mint base = generate_base()) : base(base), power{1} {}template <typename STRING>vector<mint> build(const STRING& s) const {int sz = s.size();vector<mint> hashed(sz + 1, mint(0));for (int i = 0; i < sz; i++) { hashed[i + 1] = hashed[i] * base + s[i]; }return hashed;}template <typename STRING>mint eval(STRING& s) {mint x = 0;for (auto& ch: s) x = base * x + ch;return x;}mint query(const vc<mint>& s, int l, int r) {assert(0 <= l && l <= r && r < len(s));expand(r - l);return (s[r] - s[l] * power[r - l]);}mint combine(mint h1, mint h2, int h2len) {expand(h2len);return h1 * power[h2len] + h2;}mint add_char(mint h, int x) { return h * base + mint(x); }int lcp(const vc<mint>& a, int l1, int r1, const vc<mint>& b, int l2,int r2) {int len = min(r1 - l1, r2 - l2);int low = 0, high = len + 1;while (high - low > 1) {int mid = (low + high) / 2;if (query(a, l1, l1 + mid) == query(b, l2, l2 + mid))low = mid;elsehigh = mid;}return low;}};#line 2 "/home/maspy/compro/library/poly/middle_product.hpp"#line 2 "/home/maspy/compro/library/poly/ntt.hpp"template <class mint>void ntt(vector<mint>& a, bool inverse) {assert(mint::can_ntt());const int rank2 = mint::ntt_info().fi;const int mod = mint::get_mod();static array<mint, 30> root, iroot;static array<mint, 30> rate2, irate2;static array<mint, 30> rate3, irate3;assert(rank2 != -1 && len(a) <= (1 << max(0, rank2)));static bool prepared = 0;if (!prepared) {prepared = 1;root[rank2] = mint::ntt_info().se;iroot[rank2] = mint(1) / root[rank2];FOR_R(i, rank2) {root[i] = root[i + 1] * root[i + 1];iroot[i] = iroot[i + 1] * iroot[i + 1];}mint prod = 1, iprod = 1;for (int i = 0; i <= rank2 - 2; i++) {rate2[i] = root[i + 2] * prod;irate2[i] = iroot[i + 2] * iprod;prod *= iroot[i + 2];iprod *= root[i + 2];}prod = 1, iprod = 1;for (int i = 0; i <= rank2 - 3; i++) {rate3[i] = root[i + 3] * prod;irate3[i] = iroot[i + 3] * iprod;prod *= iroot[i + 3];iprod *= root[i + 3];}}int n = int(a.size());int h = topbit(n);assert(n == 1 << h);if (!inverse) {int len = 0;while (len < h) {if (h - len == 1) {int p = 1 << (h - len - 1);mint rot = 1;FOR(s, 1 << len) {int offset = s << (h - len);FOR(i, p) {auto l = a[i + offset];auto r = a[i + offset + p] * rot;a[i + offset] = l + r;a[i + offset + p] = l - r;}rot *= rate2[topbit(~s & -~s)];}len++;} else {int p = 1 << (h - len - 2);mint rot = 1, imag = root[2];for (int s = 0; s < (1 << len); s++) {mint rot2 = rot * rot;mint rot3 = rot2 * rot;int offset = s << (h - len);for (int i = 0; i < p; i++) {u64 mod2 = u64(mod) * mod;u64 a0 = a[i + offset].val;u64 a1 = u64(a[i + offset + p].val) * rot.val;u64 a2 = u64(a[i + offset + 2 * p].val) * rot2.val;u64 a3 = u64(a[i + offset + 3 * p].val) * rot3.val;u64 a1na3imag = (a1 + mod2 - a3) % mod * imag.val;u64 na2 = mod2 - a2;a[i + offset] = a0 + a2 + a1 + a3;a[i + offset + 1 * p] = a0 + a2 + (2 * mod2 - (a1 + a3));a[i + offset + 2 * p] = a0 + na2 + a1na3imag;a[i + offset + 3 * p] = a0 + na2 + (mod2 - a1na3imag);}rot *= rate3[topbit(~s & -~s)];}len += 2;}}} else {mint coef = mint(1) / mint(len(a));FOR(i, len(a)) a[i] *= coef;int len = h;while (len) {if (len == 1) {int p = 1 << (h - len);mint irot = 1;FOR(s, 1 << (len - 1)) {int offset = s << (h - len + 1);FOR(i, p) {u64 l = a[i + offset].val;u64 r = a[i + offset + p].val;a[i + offset] = l + r;a[i + offset + p] = (mod + l - r) * irot.val;}irot *= irate2[topbit(~s & -~s)];}len--;} else {int p = 1 << (h - len);mint irot = 1, iimag = iroot[2];FOR(s, (1 << (len - 2))) {mint irot2 = irot * irot;mint irot3 = irot2 * irot;int offset = s << (h - len + 2);for (int i = 0; i < p; i++) {u64 a0 = a[i + offset + 0 * p].val;u64 a1 = a[i + offset + 1 * p].val;u64 a2 = a[i + offset + 2 * p].val;u64 a3 = a[i + offset + 3 * p].val;u64 x = (mod + a2 - a3) * iimag.val % mod;a[i + offset] = a0 + a1 + a2 + a3;a[i + offset + 1 * p] = (a0 + mod - a1 + x) * irot.val;a[i + offset + 2 * p] = (a0 + a1 + 2 * mod - a2 - a3) * irot2.val;a[i + offset + 3 * p] = (a0 + 2 * mod - a1 - x) * irot3.val;}irot *= irate3[topbit(~s & -~s)];}len -= 2;}}}}#line 4 "/home/maspy/compro/library/poly/middle_product.hpp"// n, m 次多項式 (n>=m) a, b → n-m 次多項式 c// c[i] = sum_j b[j]a[i+j]template <typename mint>vc<mint> middle_product(vc<mint>& a, vc<mint>& b) {assert(len(a) >= len(b));if (b.empty()) return vc<mint>(len(a) - len(b) + 1);if (min(len(b), len(a) - len(b) + 1) <= 60) {return middle_product_naive(a, b);}if (!(mint::can_ntt())) {return middle_product_garner(a, b);} else {int n = 1 << __lg(2 * len(a) - 1);vc<mint> fa(n), fb(n);copy(a.begin(), a.end(), fa.begin());copy(b.rbegin(), b.rend(), fb.begin());ntt(fa, 0), ntt(fb, 0);FOR(i, n) fa[i] *= fb[i];ntt(fa, 1);fa.resize(len(a));fa.erase(fa.begin(), fa.begin() + len(b) - 1);return fa;}}template <typename mint>vc<mint> middle_product_garner(vc<mint>& a, vc<mint> b) {int n = len(a), m = len(b);if (!n || !m) return {};static const long long nttprimes[] = {754974721, 167772161, 469762049};using mint0 = modint<754974721>;using mint1 = modint<167772161>;using mint2 = modint<469762049>;vc<mint0> a0(n), b0(m);vc<mint1> a1(n), b1(m);vc<mint2> a2(n), b2(m);FOR(i, n) a0[i] = a[i].val, a1[i] = a[i].val, a2[i] = a[i].val;FOR(i, m) b0[i] = b[i].val, b1[i] = b[i].val, b2[i] = b[i].val;auto c0 = middle_product<mint0>(a0, b0);auto c1 = middle_product<mint1>(a1, b1);auto c2 = middle_product<mint2>(a2, b2);const long long m01 = 1LL * nttprimes[0] * nttprimes[1];const long long m0_inv_m1 = mint1(nttprimes[0]).inverse().val;const long long m01_inv_m2 = mint2(m01).inverse().val;const int mod = mint::get_mod();auto garner = [&](mint0 x0, mint1 x1, mint2 x2) -> mint {int r0 = x0.val, r1 = x1.val, r2 = x2.val;int v1 = (m0_inv_m1 * (r1 + nttprimes[1] - r0)) % nttprimes[1];auto v2 = (mint2(r2) - r0 - mint2(nttprimes[0]) * v1) * mint2(m01_inv_m2);return mint(r0 + 1LL * nttprimes[0] * v1 + m01 % mod * v2.val);};vc<mint> c(len(c0));FOR(i, len(c)) c[i] = garner(c0[i], c1[i], c2[i]);return c;}template <typename mint>vc<mint> middle_product_naive(vc<mint>& a, vc<mint>& b) {vc<mint> res(len(a) - len(b) + 1);FOR(i, len(res)) FOR(j, len(b)) res[i] += b[j] * a[i + j];return res;}#line 7 "main.cpp"using mint = modint998;void solve() {LL(N, M, K);STR(A, B);RollingHash RH;auto RAW = RH.build(A);vc<mint> F1(N), F2(N), G1(M), G2(M);FOR(i, N) F1[i] = ('a' <= A[i] && A[i] <= 'z');FOR(i, N) F2[i] = mint(1) - F1[i];FOR(i, M) G1[i] = ('a' <= B[i] && B[i] <= 'z');FOR(i, M) G2[i] = mint(1) - G1[i];for (auto& x: A) {if ('a' <= x && x <= 'z') x ^= 32;}for (auto& x: B) {if ('a' <= x && x <= 'z') x ^= 32;}vc<mint> X = middle_product<mint>(F1, G2);vc<mint> Y = middle_product<mint>(F2, G1);FOR(i, len(Y)) X[i] += Y[i];auto AH = RH.build(A);auto BH = RH.build(B);vc<u64> val;ll ANS = 0;FOR(i, len(X)) {ll cnt = X[i].val;auto a = RH.query(AH, i, i + M);auto b = RH.query(BH, 0, M);bool match = (a == b);if (match && 1 <= cnt && cnt <= K) { ++ANS; }}print(ANS);}signed main() {int T = 1;// INT(T);FOR(T) solve();return 0;}