UVa 133 - The Dole Queue

#include <iostream>
#include <iomanip>
using namespace std;
int queue[24];
int main()
{
int n,k,m;
int front,rear,count1,count2,cc;
while(cin>>n>>k>>m)
{
if(!n&&!k&&!m)
break;
for(int i=1; i<=n; i++)
queue[i]=i;
front=0;
rear=n+1;
cc=0;
while(cc<n)
{
count1=0;count2=0;
while(1)
{
if(queue[front]!=0)
{
count1++;
}
if(front>n)
front=0;
if(count1==k)
{
cout<<setw(3)<<queue[front];
cc++;
break;
}
front++;
}
while(1)
{
if(queue[rear]!=0)
{
count2++;
}
if(rear<1)
rear=n+1;
if(count2==m)
{
if(queue[front]!=queue[rear])
{
cout<<setw(3)<<queue[rear];
cc++;
}
break;
}
rear--;
}
queue[front]=0;
queue[rear]=0;
if(cc!=n)
cout<<",";
}
cout<<endl;
}
return 0;
}