Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<bits/stdc++.h>
- using namespace std;
- long long q,y;
- const long long mod=1e9+7;
- long long power(long long a,long long b){
- if(!b)return 1;
- long long p(power(a,b/2));
- if(b&1)return(a*((p*p)%mod))%mod;
- return(p*p)%mod;
- }
- long long f(long long x){
- if(!x)return y;
- return(y*power(2,x-1))%mod;
- }
- void solve(){
- long long st,dr;
- cin>>st>>dr;
- cout<<(f(dr+1)-((st)?f(st):0)+mod)%mod<<"\n";
- }
- int main(){
- ios_base::sync_with_stdio(false);
- cin.tie(nullptr);
- cout.tie(nullptr);
- cin>>q>>y;
- while(q--)solve();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement