# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#77. Combinations
#Given two integers n and k, return all possible combinations of k numbers out of 1 ... n.
#Example:
#Input: n = 4, k = 2
#Output:
#[
#  [2,4],
#  [3,4],
#  [2,3],
#  [1,2],
#  [1,3],
#  [1,4],
#]
## @param {Integer} n
## @param {Integer} k
## @return {Integer[][]}
#def combine(n, k)
#end



# Time Is Money