1 #include<bits/stdc++.h>
 2 using namespace std;
 3 typedef long long LL;
 4 
 5 #define MAXN 100010
 6 #define MAXM 100010
 7 
 8 int gcd(int a,int b)
 9 {
10     if(b==0) return a;
11     return gcd(b,a%b);
12 }
13 int d[MAXN];
14 int n,m;
15 vector<pair<int,int> > q[MAXM];
16 vector<pair<int,int> > gcds[MAXN];
17 int vis[1000010];
18 int ans[MAXM];
19 int tree[MAXN];
20 int lowbit(int x)
21 {
22     return x&(-x);
23 }
24 void add(int k,int num)
25 {
26     while(k<=n)
27     {
28         tree[k]+=num;
29         k+=lowbit(k);
30     }
31 }
32 int sum(int k)
33 {
34     int ans=0;
35     while(k)
36     {
37         ans+=tree[k];
38         k-=lowbit(k);
39     }
40     return ans;
41 }
42 int main()
43 {
44 #ifdef LOCAL
45     freopen("in.txt","r",stdin);
46 #endif
47     while(scanf("%d%d",&n,&m)!=EOF)
48     {
49         for(int i=0;i<=n;i++) gcds[i].clear();
50         for(int i=1;i<=n;i++) q[i].clear();
51         memset(vis,0,sizeof(vis));
52         memset(tree,0,sizeof(tree));
53         for(int i=1;i<=n;i++) scanf("%d",&d[i]);
54         for(int i=1;i<=m;i++)
55         {
56             int l,r;
57             scanf("%d%d",&l,&r);
58             q[r].push_back(make_pair(l,i));
59         }
60         for(int i=1;i<=n;i++)
61         {
62             if(vis[d[i]]) add(vis[d[i]],-1);
63             add(i,1);
64             vis[d[i]]=i;
65             gcds[i].push_back(make_pair(d[i],i));
66             for(unsigned int j=0;j<gcds[(i-1)].size();j++)
67             {
68                 int tmp1=gcd(gcds[(i-1)][j].first,d[i]),tmp2=gcds[(i-1)][j].second;
69                 if(tmp1==gcds[i][gcds[i].size()-1].first) continue;
70                 if(vis[tmp1]) add(vis[tmp1],-1);
71                 add(tmp2,1);
72                 vis[tmp1]=tmp2;
73                 gcds[i].push_back(make_pair(tmp1,tmp2));
74             }
75             for(unsigned int j=0;j<q[i].size();j++)
76             {
77                 int tmp=q[i][j].second;
78                 ans[tmp]=sum(i)-sum(q[i][j].first-1);
79             }
80         }
81         for(int i=1;i<=m;i++) printf("%d\n",ans[i]);
82     }
83     return 0;
84 }