# include <bits/stdc++.h>
using namespace std;
# define x first
# define y second
# define db double
# define ll long long
# define pi 3.14159265359
# define rad(x) (x * pi / 180)
const int p_1[] = {1,-1};
const int mod1 = 1e9 + 7;
const int mod2 = 666013;
const int mod3 = 997;
template < class T > inline T sqr(T x) {return x*x;}
template < class T > inline T min(T a,T b,T c) {return min(a,min(b,c));}
template < class T > inline T min(T a,T b,T c,T d) {return min(min(a,b),min(b,c));}
template < class T > inline T max(T a,T b,T c) {return max(a,max(b,c));}
template < class T > inline T max(T a,T b,T c,T d) {return max(max(a,b),max(b,c));}
template < class T > inline T det(T a,T b,T c,T d) {return a * c - b * d;}
template < class T > inline T det(T s[3][3])
{
    return - s[0][0] * det(s[1][1],s[1][2],s[2][1],s[2][2]) + s[0][1] * det(s[1][0],s[1][2],s[2][0],s[2][2]) - s[0][2] * det(s[1][0],s[1][1],s[2][0],s[2][1]);
}
template < class T1 , class T2 , class T3 > inline T3 pow(T1 a,T2 b,T3 mod) {T3 ans = 1;while (b){if (b&1) ans = (1LL * ans * a) % mod;a = (1LL * a * a) % mod;b >>= 1;}return ans;}
template < class T > T phi(T n){T cnt = n,p = n,ans = n;for (T i = 2;i*i <= p;++i)if (!(cnt%i)){ans /= i;ans *= (i-1);while (!(cnt%i)) cnt /= i;}if (cnt > 1) ans /= cnt,ans *= (cnt - 1);return ans;}
template < class T > T f(T a,T b) {return a < b ? 0 : a / b + f(a / b);}
template < class T > T gcd(T a,T b) {return __gcd(a,b);}
class Reader {
  public:
    Reader(const string& filename):
            m_stream(filename),
            m_pos(kBufferSize - 1),
            m_buffer(new char[kBufferSize]) {
        next();
    }

    Reader& operator>>(int& value) {
        value = 0;
        while (current() < '0' || current() > '9')
            next();
        while (current() >= '0' && current() <= '9') {
            value = value * 10 + current() - '0';
            next();
        }
        return *this;
    }

  private:
    const int kBufferSize = 32768;

    char current() {
        return m_buffer[m_pos];
    }

    void next() {
        if (!(++m_pos != kBufferSize)) {
            m_stream.read(m_buffer.get(), kBufferSize);
            m_pos = 0;
        }
    }

    ifstream m_stream;
    int m_pos;
    unique_ptr<char[]> m_buffer;
};
pair < int , int > s[123456];
int dp[123456];
int main(void)
{
    Reader fi("gropi.in");
    ofstream fo("gropi.out");
    int c,n;
    fi>>c>>n;
    for (int i = 1;i <= n;++i) fi>>s[i].y>>s[i].x;
    sort(s+1,s+1+n);
    for (int i = 1;i <= n;++i) dp[i] = dp[i-1] + (s[i].y != s[i-1].y);
    int m,x1,y1,x2,y2;
    fi>>m;
    while (m --)
    {
        fi>>x1>>y1>>x2>>y2;
        if (y2 < y1) swap(y1,y2),swap(x1,x2);
        int l = 0;
        for (int i = 65536;i;i /= 2)
            if (i + l <= n && s[i+l].x <= y1) l += i;
        ++l;
        int r = 0;
        for (int i = 65536;i;i /= 2)
            if (i + r <= n && s[i+r].x <= y2) r += i;
        if (s[r].x < y1 || s[l].x > y2 || !l || !r || l > n && r > n || y1 == y2) fo << y2 - y1 + 1 + (x1 != x2) << '\n';
        else
        {
            int ans = y2 - y1 + 1 + dp[r] - dp[l-1];
            if (s[l].y != x1 && s[l].x != y1) --ans;
            if (s[r].y == x2) ++ans;
            fo << ans << '\n';
        }
    }
    return 0;
}