Problem:
Bamboo Blossoms

The bamboos live for decades, and at the end of their lives,
they flower to make their seeds. Dr. ACM, a biologist, was fascinated
by the bamboos in blossom in his travel to Tsukuba. He liked
the flower so much that he was tempted to make a garden where
the bamboos bloom annually. Dr. ACM started research of
improving breed of the bamboos, and finally, he established
a method to develop bamboo breeds with controlled lifetimes.
With this method, he can develop bamboo breeds that flower
after arbitrarily specified years.

Let us call bamboos that flower k years after sowing
"k-year-bamboos."
k years after being sowed, k-year-bamboos make
their seeds and then die,
hence their next generation flowers after another k years.
In this way, if he sows seeds of k-year-bamboos, he can
see bamboo blossoms every k years. For example,
assuming that he sows seeds of 15-year-bamboos,
he can see bamboo blossoms every 15 years;
15 years, 30 years, 45 years, and so on, after sowing.

Dr. ACM asked you for designing his garden. His garden is partitioned
into blocks, in each of which only a single breed of bamboo can grow.
Dr. ACM requested you to decide which breeds of bamboos
should he sow in the blocks in order to see bamboo blossoms
in at least one block for as many years as possible.

You immediately suggested to sow seeds of one-year-bamboos in all blocks.
Dr. ACM, however, said that it was difficult to develop a bamboo breed
with short lifetime, and would like a plan using only those breeds with
long lifetimes. He also said that, although he could wait for some years
until he would see the first bloom, he would like to see it in
every following year.
Then, you suggested a plan
to sow seeds of 10-year-bamboos, for example, in different blocks each year,
that is, to sow in a block this year and in another block next year, and so on,
for 10 years. Following this plan, he could see
bamboo blossoms in one block every year except for the first 10 years.
Dr. ACM objected again saying he had determined to sow in all
blocks this year.

After all, you made up your mind to make a sowing plan where the bamboos
bloom in at least one block for as many consecutive years as possible
after the first m years (including this year)
under the following conditions:

the plan should use only those bamboo breeds whose
lifetimes are m years or longer, and

Dr. ACM should sow the seeds in all the blocks only this year.

Input

The input consists of at most 50 datasets, each in the following format.

m n

An integer m (2 ≤ m ≤ 100) represents the lifetime
(in years)
of the bamboos with the shortest lifetime that Dr. ACM can use for
gardening.
An integer n (1 ≤ n ≤ 500,000) represents the number of blocks.

The end of the input is indicated by a line containing two zeros.

Output

No matter how good your plan is, a "dull-year" would
eventually come, in which the bamboos do not flower in any block.
For each dataset, output in a line an integer meaning how many
years from now the first dull-year comes after the first m years.

Note that the input of m = 2 and n = 500,000
(the last dataset of the Sample Input) gives the largest answer.

Sample Input

3 1
3 4
10 20
100 50
2 500000
0 0

Output for the Sample Input

4
11
47
150
7368791

Solution in C (judge verdict: Wrong Answer)

/* ?????????????????????????????¨???????????????????????? */
#include <stdio.h>
#include <stdlib.h>
#include<math.h>

#define NUM 7368791

int main(void)
{
	int m, n;
	int count = 0;
	int i, j;
	int m_pre = 0;
	int used = 0;
	int *p;
	if ((p = malloc(sizeof(int) * NUM)) == NULL) {
		exit(EXIT_FAILURE);
	}
	for (i = 0; i < NUM; i++) {
		p[i] = 1;
	}
	
	/* ??????????????§??°???????????? */
	int compare = (int)pow(NUM, (1.0 / 2.0));

	while (scanf("%d %d", &m, &n) == 2) {
		if (m == 0 && n == 0) {
			break;
		}
		else{
			if (n < 1000) {
				count = m;
				while (n >= used) {
					for (j = m; j <= count; j++) {
						/* printf("count = %d, used = %d\n", count, used); */
						if (count > m) {
							if ((count % j) == 0) {
								break;
							}
							if (j == (count - 1)) {
								used++;
							}
						}
						else {
							used++;
							/*printf("check\n"); */
						}
					}
					count++;
					/*printf("???: count = %d, used = %d\n", count - 1, used); */
				}
				printf("%d\n", count - 1);

				/* ????????? */
				used = 0;
			}
			else {
				if (m <= m_pre) {
					for (i = m; i <= m_pre; i++) {
						for (j = 2; NUM > (j * i); j++) {
							p[(i * j) - 1] = 0;
						}
					}
				}
				else {
					/* ????????? */
					for (i = 0; i < NUM; i++) {
						p[i] = 1;
					}
					/* m??\????????°?????????????????°?????????????????¨??? , ??¨????????????????????????????????????????????????*/
					for (i = m; i <= compare; i++) {
						/* i????????°???NUM???????°???????????????? */
						for (j = 2; NUM > (j * i); j++) {
							p[(i * j) - 1] = 0;
						}
					}
				}

				/* count???n + 1??????????????§i????????? -> ????±??????´??????????????§i????????? */
				for (i = m; ; i++) {
					if ((p[i - 1]) == 1) {
						count++;
					}
					if (count == (n + 1)) {
						printf("%d\n", i);
						break;
					}
				}
				/* ????????? */
				m_pre = m;
			}
			/* ????????? */
			count = 0;
		}
	}

	free(p);
	return 0;
}