import java.util.*;
import java.io.*;

public class Binomial3 {

    private static long binomial(int N,int K){
	long[][] binomial = new long[N+1][K+1]; 
	for (int k=1;k<=K;k++) binomial[0][k] = 0;
	for (int n=0;n<=N;n++) binomial[n][0] = 1;
	for (int n=1;n<=N;n++)
	    for (int k=1;k<=K;k++)
		binomial[n][k] = binomial[n-1][k-1] + binomial[n-1][k];
	return binomial[N][K];
    }
    //
    // compute n choose k
    //


    public static void main(String[] args) throws IOException {
	int N = Integer.parseInt(args[0]);
	int K = Integer.parseInt(args[1]);
	//System.out.println(binomial(N,K));

	long sum = 0;
	long bin = 0;
	for (int k=0;k<=K;k++){
	    bin = binomial(N,k);
	    sum = sum + bin;
	    //System.out.println(N +" "+ k +" "+ bin +" "+ sum);
	}
	System.out.println(N +" "+ sum +" "+ N*sum);
	// 
	// print out the sum of n.choose.k for 0<=k<=n
	// this gives the total search space for a problem 
	// solved by lds that went to a maximum of K discrepancies
	//	
    }
}

//
//