#include<stdio.h>
int main()
{
int t,i,j,flag,k;
int m[10], n[10];
printf(“enter test cases”);
scanf("%d",&t);
for(i=0;i<t;i++)
{
printf(“enter number 1 for test case”);
scanf("%d", &m[i]);
printf(“enter number 2 for test case”);
scanf("%d", &n[i]);
}
for(k=0;k<t;k++)
{
if(m[k] < 2)
{
printf("2\n");
}
for (i = m[k]; i <= n[k];i++)
{
for(j = 2; j<i;j++)
{
if(i%j == 0)
{
flag =0;
break;
}
else
{
flag =1;
}
}
if(flag == 1)
{
printf("%d\n", i);
}
}
printf("\n");
}
return 0;
}
please tell me how to optimize the above code