#include<stdio.h>
int checkIfPrime(long x);
long nextPrimeN(long N);
void firstMPrime(int M);
int main()
{
  int k=15;
  printf("Printing first %d Prime numbers:\n",k);
  firstMPrime(k);printf("\n");
  return 0;
}
int checkIfPrime(long x)
{
  long sum = 0,i = 0,n=x;
  for(i = 2;i<x;i++)
  {
    if(x%i == 0)
      return 0;
  }
  return 1;
 
}
long nextPrimeN(long N)
{
  long i=0;
  for(i = N+1;i > N;i++)
  {
    //printf("%ld\n",i);
    if(checkIfPrime(i))
      return i;
  }
  return 0;
}
void firstMPrime(int M)
{
  long count = 0,n=0;
  while(count < M)
  {
    n = nextPrimeN(n);
    printf("%ld\n",n);
    count++;
  }
}