//完成しています
#include <stdio.h>
 
int factorial(int n);
 
int comb(int m, int k);
 
int main(void){
	int m,k,result;
 
	scanf("%d%d",&m,&k);
	result=comb(m,k);
	printf("%d個の中から%d個を取り出す組み合わせ数は、%d通りです。",m,k,result);
	return 0;
}
 
//階乗をする関数
int factorial(int n){
	int i,result=1;
 
	for( i=n; i>1; i--) result*=i;
	return result;
}
 
//組み合わせの数を計算する関数
int comb(int m, int k){
	int result;
 
	result=factorial(m)/(factorial(k)*factorial(m-k));
	return result;
}

Ly/lrozmiJDjgZfjgabjgYTjgb7jgZkKI2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgZmFjdG9yaWFsKGludCBuKTsKCmludCBjb21iKGludCBtLCBpbnQgayk7CgppbnQgbWFpbih2b2lkKXsKCWludCBtLGsscmVzdWx0OwoJCglzY2FuZigiJWQlZCIsJm0sJmspOwoJcmVzdWx0PWNvbWIobSxrKTsKCXByaW50ZigiJWTlgIvjga7kuK3jgYvjgoklZOWAi+OCkuWPluOCiuWHuuOBmee1hOOBv+WQiOOCj+OBm+aVsOOBr+OAgSVk6YCa44KK44Gn44GZ44CCIixtLGsscmVzdWx0KTsKCXJldHVybiAwOwp9CgovL+majuS5l+OCkuOBmeOCi+mWouaVsAppbnQgZmFjdG9yaWFsKGludCBuKXsKCWludCBpLHJlc3VsdD0xOwoJCglmb3IoIGk9bjsgaT4xOyBpLS0pIHJlc3VsdCo9aTsKCXJldHVybiByZXN1bHQ7Cn0KCi8v57WE44G/5ZCI44KP44Gb44Gu5pWw44KS6KiI566X44GZ44KL6Zai5pWwCmludCBjb21iKGludCBtLCBpbnQgayl7CglpbnQgcmVzdWx0OwoJCglyZXN1bHQ9ZmFjdG9yaWFsKG0pLyhmYWN0b3JpYWwoaykqZmFjdG9yaWFsKG0taykpOwoJcmV0dXJuIHJlc3VsdDsKfQ==

MTAgNA==

10 4