Void main()

{ ulong M,N,v,k,m;

printf("N = "); scanf("%lu",&N);

M = (N<=200 ? 1.6*N/log(N)+1 : N/(log(N)-2)+1);

printf("M = %lu \n", M);

ulong* x = new ulong[M];

x[0]=1; x[1]=2; x[2]=3; m=3; v=5;

while (v<=N) { for (k=2;k<m;k++) if (v%x[k]==0) break;

if (k==m) x[m++]=v;

v+=2;

}

printf("m = %lu \n", m);

for (k=0;k<m;k++) printf("%6lu",x[k]); puts("");

delete[] x;

}