The sum problem

The sum problem | JXNUOJ

translate ：

describe ：

Given a sequence 1,2,3,......N, Your job is to calculate the sum of all possible subsequences as M The subsequence .

Input ：

The input contains multiple test cases . Each case contains two integers N, M( 1 <= N, M <= 1000000000). Enter to N = M = 0 ending .

Output ：

For each test case , Print its total as M All possible subsequences of . The format is shown in the following example . Print a blank line after each test case .