G国发行了n种不同面值的邮票，并且规定每张信封上最多只允许贴m张邮票。连续邮资问题要求对于给定的n和m的值，给出邮票面值的最佳设计，使得可在1张信封上贴出从邮资1开始，增量为1的最大连续邮资区间。例如，当n=5和m=4时，面值为(1,3,11,15,32)的5种邮票可以贴出邮资的最大连续邮资区间是1到70。编程任务: 对于给定的正整数m和n，计算出邮票面值的最佳设计。

-G n kinds of countries issued stamps of different denominations, and provides up to allow only affixed on each envelope m stamps. Continuous postage required for a given problem n and m values, given the nominal value of the stamp best design, makes it possible to start from postage 1 posted on an envelope, postage increments of the maximum continuous interval of 1. For example, when n = 5 and m = 4, the nominal value (1,3,11,15,32) can put five kinds of postage stamps postage maximum continuous interval is 1-70. Programming tasks: For a given positive integers m and n, calculate the optimal design of the stamp denominations.