# DRUNKWATER TEMPLATE(add description and prototypes)
# Question Title and Description on leetcode.com
# Function Declaration and Function Prototypes on leetcode.com
#498. Diagonal Traverse
#Given a matrix of M x N elements (M rows, N columns), return all elements of the matrix in diagonal order as shown in the below image.
#Example:
#Input:
#[
# [ 1, 2, 3 ],
# [ 4, 5, 6 ],
# [ 7, 8, 9 ]
#]
#Output:  [1,2,4,7,5,3,6,8,9]
#Explanation:
#Note:
#The total number of elements of the given matrix will not exceed 10,000.
## @param {Integer[][]} matrix
## @return {Integer[]}
#def find_diagonal_order(matrix)
#end



# Time Is Money