//题目大意,给定N个商店,有初始商品数量.有两种指令,0 x y 表示x位置的商店的商品数量增加y
//1 x y 表示查询[x,y]区间内的商品数量为素数的商店的数目..
//这里更新的条件就变成去判断更新值是否从非素数变成素数或是从素数变成非素数..
//然后对树状数组进行更行..
//题目连接:http://acm.hit.edu.cn/hoj/problem/view?id=1867
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<vector>
using namespace std;
const int MN = 1100100;
int tree[MN],num[MN],n;
bool vis[MN];
bool judge(int x)
{
if(x <= 1)return 0;
for(int i = 2 ; i*i <= x ; i++)
{
if(x % i == 0)return 0;
}
return 1;
}
int Lowbit(int x)
{
return x&(-x);
}
void Updata(int x)
{
if(judge(num[x]))
{
if(!vis[x])
{
vis[x] = 1;
while(x <= n)
{
tree[x]++;
x += Lowbit(x);
}
}
}
else
{
if(vis[x])
{ vis[x] = 0;
while(x <= n)
{
tree[x]--;
x += Lowbit(x);
}
}
}
}
int Getsum(int x)
{
int sum = 0;
while(x > 0)
{
sum += tree[x];
x -= Lowbit(x);
}
return sum;
}
int main()
{
int m,k,t = 0;
while(scanf("%d%d%d",&n,&k,&m) && n+k+m != 0)
{
t++;
if(n > 1000000)while(1);
printf("CASE #%d:\n",t);
for(int i = 1 ; i <= n ; i++)
num[i] = m;
if(judge(m))
{
for(int i = 1 ; i <= n ; i++)
{
vis[i] = 1;
tree[i] = Lowbit(i);
}
}
else {memset(tree,0,sizeof(tree));memset(vis,0,sizeof(vis));}
int a,x,y;
for(int i = 1 ; i <= k ; i++)
{
scanf("%d%d%d",&a,&x,&y);
if(a)
{
printf("%d\n",Getsum(y)-Getsum(x-1));
}
else
{
num[x] += y;
Updata(x);
}
}
printf("\n");
}
return 0;
}
//1 x y 表示查询[x,y]区间内的商品数量为素数的商店的数目..
//这里更新的条件就变成去判断更新值是否从非素数变成素数或是从素数变成非素数..
//然后对树状数组进行更行..
//题目连接:http://acm.hit.edu.cn/hoj/problem/view?id=1867
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
#include<string.h>
#include<vector>
using namespace std;
const int MN = 1100100;
int tree[MN],num[MN],n;
bool vis[MN];
bool judge(int x)
{
if(x <= 1)return 0;
for(int i = 2 ; i*i <= x ; i++)
{
if(x % i == 0)return 0;
}
return 1;
}
int Lowbit(int x)
{
return x&(-x);
}
void Updata(int x)
{
if(judge(num[x]))
{
if(!vis[x])
{
vis[x] = 1;
while(x <= n)
{
tree[x]++;
x += Lowbit(x);
}
}
}
else
{
if(vis[x])
{ vis[x] = 0;
while(x <= n)
{
tree[x]--;
x += Lowbit(x);
}
}
}
}
int Getsum(int x)
{
int sum = 0;
while(x > 0)
{
sum += tree[x];
x -= Lowbit(x);
}
return sum;
}
int main()
{
int m,k,t = 0;
while(scanf("%d%d%d",&n,&k,&m) && n+k+m != 0)
{
t++;
if(n > 1000000)while(1);
printf("CASE #%d:\n",t);
for(int i = 1 ; i <= n ; i++)
num[i] = m;
if(judge(m))
{
for(int i = 1 ; i <= n ; i++)
{
vis[i] = 1;
tree[i] = Lowbit(i);
}
}
else {memset(tree,0,sizeof(tree));memset(vis,0,sizeof(vis));}
int a,x,y;
for(int i = 1 ; i <= k ; i++)
{
scanf("%d%d%d",&a,&x,&y);
if(a)
{
printf("%d\n",Getsum(y)-Getsum(x-1));
}
else
{
num[x] += y;
Updata(x);
}
}
printf("\n");
}
return 0;
}