#include <bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("avx,avx2,fma")
#define ll long long
#define fi first
#define se second
#define pb push_back
#define vi vector<int>
#define vl vector<ll>
#define pi pair<int, int>
#define pl pair<ll,ll>
#define all(x) (x).begin(),(x).end()
const int mod=1e9+7;
int get(int x, int y) {
ll mx=max(abs(x),abs(y));
mx--;
ll t=(2ll*mx+1)*(2ll*mx+1)%mod;
if (x==mx+1 && y==-mx-1) {
return (2ll*mx+3)*(2ll*mx+3)%mod;
}
if (x==mx+1) {
return (t+mx+1+y)%mod;
}
t+=(mx+1)*2;
t%=mod;
if (y==mx+1) {
return (t+mx+1-x)%mod;
}
t+=(mx+1)*2;
t%=mod;
if (x==-mx-1) {
return (t+mx+1-y)%mod;
}
t+=(mx+1)*2;
t%=mod;
return (t+mx+1+x)%mod;
}
int32_t main() {
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
int n,q;
cin >> n >> q;
vector<vl> sum(2*n+2,vl(2*n+2,0));
for (int i=-n; i<=n; i++) {
for (int j=-n; j<=n; j++) {
sum[i+n+1][j+n+1]=get(i,j);
sum[i+n+1][j+n+1]+=sum[i+n+1][j+n]+sum[i+n][j+n+1]-sum[i+n][j+n];
sum[i+n+1][j+n+1]=(sum[i+n+1][j+n+1]%mod+mod)%mod;
}
}
int x1,y1,x2,y2;
for (int i=0; i<q; i++) {
cin >> x1 >> y1 >> x2 >> y2;
x1+=n+1;
y1+=n+1;
x2+=n+1;
y2+=n+1;
ll ans=sum[x2][y2]-sum[x1-1][y2]-sum[x2][y1-1]+sum[x1-1][y1-1];
ans=(ans%mod+mod)%mod;
cout << ans << '\n';
}
return 0;
}
