#include using namespace std; const long long MOD=1e9+7,MAX=1e5+10; template class modint{ using u64=uint_fast64_t; public: u64 a; constexpr modint(const u64 x=0) noexcept:a(((x%Modulus)+Modulus)%Modulus){} constexpr u64 &value() noexcept{return a;} constexpr const u64 &value() const noexcept{return a;} constexpr modint &operator+=(const modint &rhs) noexcept{ a+=rhs.a; if (a>=Modulus) a-=Modulus; return *this; } constexpr modint operator+(const modint &rhs) const noexcept{ return modint(*this)+=rhs; } constexpr modint &operator++() noexcept{ return ++a,*this; } constexpr modint operator++(int) noexcept{ modint t=*this; return ++a,t; } constexpr modint &operator-=(const modint &rhs) noexcept{ if (a>=1; } return *this; } constexpr modint operator/(const modint &rhs) const noexcept{ return modint(*this)/=rhs; } constexpr modint operator-() const noexcept{ return modint(Modulus-a); } constexpr bool operator==(const modint &rhs) const noexcept{ return a==rhs.a; } constexpr bool operator!=(const modint &rhs) const noexcept{ return a!=rhs.a; } constexpr bool operator!() const noexcept{return !a;} friend constexpr modint pow(modint rhs,long long exp) noexcept{ modint res{1}; while(exp){ if (exp&1) res*=rhs; rhs*=rhs; exp>>=1; } return res; } template friend constexpr modint operator+(T x,modint y) noexcept{ return modint(x)+y; } template friend constexpr modint operator-(T x,modint y) noexcept{ return modint(x)-y; } template friend constexpr modint operator*(T x,modint y) noexcept{ return modint(x)*y; } template friend constexpr modint operator/(T x,modint y) noexcept{ return modint(x)/y; } friend ostream &operator<<(ostream &s,const modint &rhs) noexcept{ return s << rhs.a; } friend istream &operator>>(istream &s,modint &rhs) noexcept{ u64 a; rhs=modint{(s >> a,a)}; return s; } }; using mint=modint; int main(){ cin.tie(0); ios::sync_with_stdio(false); int N,M; cin >> N >> M; vector> dpv(N+1,vector(MAX,0)) ,dpr(M+1,vector(MAX,0)); dpv[0][0]=dpr[0][0]=1; for (int i=0;i> V; for (int j=0;j> C; for (int j=0;j> A >> B; mint ans=0; vector sum(MAX,0); for (int i=1;i