Little change

Codeforces Round 1090 (Div. 4)/G. The 67th Iteration of "Counting is Fun".cpp

@@ -114,17 +114,6 @@ void solve()
         pref[i] += pref[i - 1];
     }
 
-    auto fpow = [&](ll a, ll p) {
-        ll ans = 1;
-        rep(i, 61) {
-            if ((p >> i) & 1) {
-                (ans *= a) %= mod;
-            }
-            (a *= a) %= mod;
-        }
-        return ans;
-    };
-
     nrep(i, 1, m) {
         ll r = pref[i];
         ll l = pref[i - 1];