Distribute_m_items_in_circle

// n ==> Size of circle
// m ==> Number of items
// k ==> Initial position
int lastPosition(int n, int m, int k)
{
	if(m<=n-k+1)
	return m+k-1;
	m=m-(n-k+1);
  	if(m%n==0)
  	return n;
  	else
  	return m%n;
}