Joseph problem C language

The time limit : 1 Sec Memory limit : 128 MB
Title Description
Joseph's question ： Yes ｎ Only monkey , Circle clockwise to choose the king （ Number from １ To ｎ）, from The first １ Number Start counting , Count to ｍ, Count to ｍ The monkey out of the circle , The rest of the monkeys went on from 1 Start counting . That's it , Until there's only one monkey left in the circle , This monkey is the monkey king , Programming for input ｎ,ｍ after , Output the number of the last Monkey King .

Input
Each line is two integers separated by spaces , The first is n, The second is m ( 0 < m,n <=300). The last line is ：

0 0

Output
For each row of input data （ Except for the last line ), The output data is also a line , The number of the last Monkey King

The sample input
6 2
12 4
8 3
0 0
Sample output
5
1
7

Ideas ：
The idea is very simple. Use an array to record everyone's elimination status , Initialize all to 0, Obsolete assigned as 1,i=(i+1)%n Form a ring .

#include<stdio.h>
int main()
{
    
	int m,n;
	while(1)
	{
    
		int a[305]={
    0};
		scanf("%d%d",&n,&m);
		if(n == 0 && m == 0)
			break;
		int t=n-1,i=-1;
		int count=0;
		while(t--)                    
		{
    
			while(count != m)
			{
    
				i=(i+1)%n;       // The problem is from 1 Start , We are from 0 At the beginning 
				if(a[i] == 0)
					count++;
			}
			a[i]=1;
			count=0;
		}
		for( i=0; i<n; i++)
			if(a[i] == 0)
				break;
		printf("%d\n",i+1);     // Be sure to add one 
	}
	return 0;
} 

Time complexity bit O(n*m)