diff --git a/README.md b/README.md
index 7b38e359e5ea7c4228ad7d14eb5c2fce5dcb8ac3..7e055d579b59c47e2dec79359c1fe274b3134747 100644
--- a/README.md
+++ b/README.md
@@ -55,7 +55,14 @@ He completed his worldwide festive quest!
 In this challenge, you are provided with a list of cities and their coordinates in `00_data/point_cloud.csv`. Your task is to create the shortest possible path that visits all the cities.
 
 ## Submission File
-Your submission should be an ordered list of cities, representing the path in which you visit each city.
+Your submission CSV-file contains the ordered Path that Santa should use to visit all the cities. It should be an ordered list of citie, representing the path in which you visit each city. Paths must start and end at the North Pole (ID = 1) and you must visit every city exactly once. Submission files must have a header and should look like:
+<code>
+Path
+1
+2
+...
+0
+</code>
 
 ## Path Constraints
 - Paths must start and end at the North Pole (`ID = 1`).
@@ -66,18 +73,8 @@ Your submission should be an ordered list of cities, representing the path in wh
 ## Evaluation
 Your submission is scored on the Euclidean distance of your submitted path.
 
-##Submission file
-Your submission file contains the ordered Path that Santa should use to visit all the cities. Paths must start and end at the North Pole (ID = 1) and you must visit every city exactly once. Submission files must have a header and should look like:
-<code>
-Path
-1
-2
-...
-0
-</code>
-
 ## Prizes
-The first prize is  a AIDAHO t-shirt!
+The submission with the shortest path will receive an AIDAHO t-shirt!
 
 ## Deadline
 January 10, 2023 - Final submission deadline.