while people enjoy spend time solve programming contest Dina prefer take beautiful picture as soon Byteland Botanical Garden announce Summer Oenothera Exhibition decide test new camera therethe exhibition consist l 10100 Oenothera specie arrange row consecutively number integer 0 l 1 camera lens allow photo w specie ie Dina photo contain flower index x x w 1 integer x 0 l w we denote photo x x w 1she take n photo ith chronological order x_i x_i w 1 notation she decide build timelapse video photo discover oenothera blossom open evening Dina take photo truncate leave segment contain exactly k flower compose video photo keep original order voilà beautiful artwork createdA scene contiguous sequence photo set flower the change scene call cut for example consider photo contain flower 1 5 second photo contain flower 3 7 photo contain flower 8 12 if k 3 Dina truncate second photo 3 5 photo 9 11 first photo form scene photo form scene transition scene happen second photo cut if k 4 transition photo cutDina want number cut small possible please help calculate minimum possible number cut different value k