import
java.util.*;
class
GFG
{
public
static
int
rec(
int
[] arr,
int
i,
int
k,
int
c,
int
n,
int
ans,
int
sum)
{
if
(sum == n && c <= k) {
ans++;
return
ans;
}
if
(i >= arr.length || sum > n || c > k)
return
ans;
ans = rec(arr, i +
1
, k, c +
1
, n, ans,
sum + arr[i]);
ans = rec(arr, i +
1
, k, c, n, ans, sum);
return
ans;
}
public
static
int
combinationSum(
int
k,
int
n)
{
int
[] arr =
new
int
[
9
];
for
(
int
i =
0
; i <
9
; i++) {
arr[i] =
0
;
}
for
(
int
i =
1
; i <=
9
; i++)
arr[i -
1
] = i;
int
ans =
0
;
ans = rec(arr,
0
, k,
0
, n, ans,
0
);
return
ans;
}
public
static
void
main(String[] args)
{
int
N =
9
, K =
3
;
System.out.println(combinationSum(K, N));
}
}