There is a map (256,256) and you are at position (33,33). On the map are following important locations:
1. NAME_1
2. NAME_2's hut at (122,118)
3. forest (124,124) to (128,128)
4. windmill at (88,227)
5. Village (132,177)
6. NAME_3 in the village
7. Pizzeria (33,77)
It is 9AM now. You have to be at pizzeria at 12:00 to deliver pizzas to: NAME_4, NAME_1, miller. The NAME_3 is at home only after 14:00, so be sure he is at home when you deliver pizza to him. Each step on the map takes 2 min, find shortest path to deliver ALL the pizzas in most optimal way, state your route and amount of steps between way-points and time requirements  between the way-points. 
 There should be exactly 7 paragraphs separated by the markdown divider: ***.
user