diff --git a/Daily/Fillup_buckets.cpp b/Daily/Fillup_buckets.cpp
index 76ffd988..f1f2fc9a 100644
--- a/Daily/Fillup_buckets.cpp
+++ b/Daily/Fillup_buckets.cpp
@@ -2,6 +2,7 @@
 Given n buckets and infinite number of balls. The maximum capacity of each bucket is given in an array capacity[]. 
 Find the number of ways to fill the buckets with balls such that each bucket has atleast 1 ball and all the buckets have distinct number
  of balls in them.Note: Since the answer may be very large, calculate the answer modulo 10^9+7.
+ 
 Input: 
 n = 1
 capacity = [6]