#include<bits/stdc++.h>
#define poly vector<int>
#define IOS ios::sync_with_stdio(false)
#define ll long long
#define mp make_pair
#define mt make_tuple
#define pa pair < int,int >
#define fi first
#define se second
#define mod 998244353
#define sz(x) ((int)((x).size()))
#define int ll
// #define N 
using namespace std;
const int inf=1e18;
pair<int,pa>all[10000005],all1[10000005];
map<int,int>tot;
int cnt,cnt1;
int n,q;
void BellaKira()
{
    cin>>n>>q;
    for (int i=1;i<=n;i++)
    {
        int x,y;
        cin>>x>>y;
        int tots=0;
        while (1)
        {
            if (min(x,y)==0) break;
            tots++;
            if (max(x,y)%min(x,y)==0) tot[min(x,y)]++;
            if (x==y)
            {
                break;
            } else
            if (x<y)
            {
                all[++cnt]=mp(x,mp(y%x,y));
                y%=x;
            } else 
                all1[++cnt1]=mp(y,mp(x%y,x)),x%=y;
        }
        // if (i%100==0) 
        //     cerr<<cnt<<" "<<cnt1<<endl;
    }
    sort(all+1,all+cnt+1);
    sort(all1+1,all1+cnt1+1);
    while (q--)
    {
        int ans=0;
        int x,y;
        cin>>x>>y;
        if (x==y)
        {
            ans+=tot[x];
        } else
        if (x<y)
        {
            int l=lower_bound(all+1,all+cnt+1,mp(x,mp(y%x,y)))-all;
            int r=lower_bound(all+1,all+cnt+1,mp(x,mp(y%x,inf)))-all;
            ans+=r-l;
        } else
        {
            int l=lower_bound(all1+1,all1+cnt1+1,mp(y,mp(x%y,x)))-all1;
            int r=lower_bound(all1+1,all1+cnt1+1,mp(y,mp(x%y,inf)))-all1;
            ans+=r-l;
        }
        cout<<ans<<'\n';
    }

}
signed main()
{
    IOS;
    cin.tie(0);
    int T=1;
    while (T--)
    {
        BellaKira();
    }
}
/*list:
1.mod 998244353 or 1e9+7 or ???
2.N
3.duipai shuju xingtai duoyidian
...
*/