# Step Up

## Problem:-

After completing his studies Jugnu joined a software company. his office in a huge multi-storey building. today he is late for his office and there is no lift for going up.
Jugnu is tall, he has to step up in a building having N number of steps. The steps are numbered as 1 to N. he is at the Xth step and he has to reach Yth step.
He  don’t like prime number so he is going to skip the prime steps.
You are going to find which steps having his footprint and count of footprint.
Coinstraints:
1<=T<=20
10<=N<=1000
2<=X<Y<=1000
SAMPLE INPUT

`22 103 15`
SAMPLE OUTPUT

`46891054689101214158`
Explanation

Input:
First input is number of test case.
Second input is and Y in a same line for first test case.
Third input is X and Y in a same line for second test case.
Output:

`4, 6, 8, 9 and 10 is footprint and 5 is count of footprint of first test case.`
`4, 6, 8, 9, 10, 12, 14 and 15 is footprint and 8 is count of footprint of second test case.`
Time Limit:1.0 sec(s) for each input file.
Memory Limit:256 MB
Source Limit:1024 KB

## solution:-

#include<stdio.h>
void main()
{
int t,x,y,k,sum=0;
scanf(“%d”,&t);
for(int i=0;i<t;i++)
{
scanf(“%d%d”,&x,&y);
for(int j=x;j<=y;j++)
{
for(k=2;k<j;k++)
{
if(j%k==0)
break;
}
if(k==j)
continue;
else
{
printf(“%dn”,j);
sum++;
}
}
printf(“%dn”,sum);
sum=0;
}
}