#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
const int Mo=(int)1e9+7;
int i,j,m,n,p,k,q,l,r,x,F[3005][3005],inv[300005];
struct Node{int x,y;}A[300005];
inline int power(int x,int y) { int sum=1; for (;y;y>>=1) { if (y&1) sum=1ll*sum*x%Mo; x=1ll*x*x%Mo; } return sum; }
int main()
{
     scanf("%d",&n);
     for (i=0;i<=250000;++i) inv[i]=power(i,Mo-2);
     for (i=1;i<=n;++i) scanf("%d%d",&A[i].x,&A[i].y),F[i][i]=A[i].y;
     for (i=1;i<n;++i) F[i][i+1]=1ll*(A[i].y-A[i+1].y+Mo)*(inv[abs(A[i].x-A[i+1].x)]*(A[i].x-A[i+1].x<0?-1:1)+Mo)%Mo;
     for (i=2;i<=n;++i) 
      for (j=1;j<=n;++j) if (i+j<=n) F[j][j+i]=1ll*(F[j][j+i-1]-F[j+1][j+i]+Mo)*1ll*(inv[abs(A[j].x-A[i+j].x)]*(A[j].x-A[i+j].x<0?-1:1)+Mo)%Mo;
    scanf("%d",&q);
    for (;q--;)
    {
           scanf("%d%d%d",&l,&r,&x);
           int ans=A[l].y,sky=1;
           for (i=l+1;i<=r;++i) sky=1ll*(1ll*sky*(x-A[i-1].x)+Mo)%Mo,ans=1ll*(ans+1ll*sky*F[l][i]%Mo)%Mo,(ans+=Mo)%=Mo;
           printf("%d\n",ans);
    }
}