Ants000

<p class="p0" style="text-align:justify;"> <span style="font-size:12.0000pt;font-family:'宋体';">An&nbsp;army&nbsp;of&nbsp;ants&nbsp;walk&nbsp;on&nbsp;a&nbsp;horizontal&nbsp;pole&nbsp;of&nbsp;length&nbsp;l&nbsp;cm,&nbsp;each&nbsp;with&nbsp;a&nbsp;constant&nbsp;speed</span> </p> <p class="p0" style="text-align:justify;"> <span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;of&nbsp;1&nbsp;cm/s.&nbsp;When&nbsp;a&nbsp;walking&nbsp;ant&nbsp;reaches&nbsp;an&nbsp;end&nbsp;of&nbsp;the&nbsp;pole,&nbsp;it&nbsp;immediatelly&nbsp;falls&nbsp;off&nbsp;</span> </p> <p class="p0" style="text-align:justify;"> <span style="font-size:12.0000pt;font-family:'宋体';">it.&nbsp;When&nbsp;two&nbsp;ants&nbsp;meet&nbsp;they&nbsp;turn&nbsp;back&nbsp;and&nbsp;start&nbsp;walking&nbsp;in&nbsp;opposite&nbsp;directions.&nbsp;We</span> </p> <p class="p0" style="text-align:justify;"> <span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;know&nbsp;the&nbsp;original&nbsp;positions&nbsp;of&nbsp;ants&nbsp;on&nbsp;the&nbsp;pole,&nbsp;unfortunately,&nbsp;we&nbsp;do&nbsp;not&nbsp;know&nbsp;the&nbsp;</span> </p> <p class="p0" style="text-align:justify;"> <span style="font-size:12.0000pt;font-family:'宋体';">directions&nbsp;in&nbsp;which&nbsp;the&nbsp;ants&nbsp;are&nbsp;walking.&nbsp;Your&nbsp;task&nbsp;is&nbsp;to&nbsp;compute&nbsp;the&nbsp;earliest&nbsp;and&nbsp;</span> </p> <p class="p0" style="text-align:justify;"> <span style="font-size:12.0000pt;font-family:'宋体';">the&nbsp;latestpossible&nbsp;times&nbsp;needed&nbsp;for&nbsp;all&nbsp;ants&nbsp;to&nbsp;fall&nbsp;off&nbsp;the&nbsp;pole.</span><span style="font-size:12.0000pt;font-family:'宋体';"></span> </p>

<p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">The&nbsp;first&nbsp;line&nbsp;of&nbsp;input&nbsp;contains&nbsp;one&nbsp;integer&nbsp;giving&nbsp;the&nbsp;number&nbsp;of&nbsp;cases&nbsp;that&nbsp;follow.</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;The&nbsp;data&nbsp;for&nbsp;each&nbsp;case&nbsp;start&nbsp;with&nbsp;two&nbsp;integer&nbsp;numbers:&nbsp;the&nbsp;length&nbsp;of&nbsp;the&nbsp;pole&nbsp;(in&nbsp;cm)</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">&nbsp;and&nbsp;n,&nbsp;the&nbsp;number&nbsp;of&nbsp;ants&nbsp;residing&nbsp;on&nbsp;the&nbsp;pole.&nbsp;These&nbsp;two&nbsp;numbers&nbsp;are&nbsp;followed&nbsp;by&nbsp;n&nbsp;i</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">ntegers&nbsp;giving&nbsp;the&nbsp;position&nbsp;of&nbsp;each&nbsp;ant&nbsp;on&nbsp;the&nbsp;pole&nbsp;as&nbsp;the&nbsp;distance&nbsp;measured&nbsp;from&nbsp;the&nbsp;</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">left&nbsp;end&nbsp;of&nbsp;the&nbsp;pole,&nbsp;in&nbsp;no&nbsp;particular&nbsp;order.&nbsp;All&nbsp;input&nbsp;integers&nbsp;are&nbsp;not&nbsp;bigger&nbsp;than&nbsp;1</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">000000&nbsp;and&nbsp;they&nbsp;are&nbsp;separated&nbsp;by&nbsp;whitespace.</span> </p>

<p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">For&nbsp;each&nbsp;case&nbsp;of&nbsp;input,&nbsp;output&nbsp;two&nbsp;numbers&nbsp;separated&nbsp;by&nbsp;a&nbsp;single&nbsp;space.&nbsp;The&nbsp;first&nbsp;</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">number&nbsp;is&nbsp;the&nbsp;earliest&nbsp;possible&nbsp;time&nbsp;when&nbsp;all&nbsp;ants&nbsp;fall&nbsp;off&nbsp;the&nbsp;pole&nbsp;(if&nbsp;the&nbsp;direction</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">s&nbsp;of&nbsp;their&nbsp;walks&nbsp;are&nbsp;chosen&nbsp;appropriately)&nbsp;and&nbsp;the&nbsp;second&nbsp;number&nbsp;is&nbsp;the&nbsp;latest&nbsp;possibl</span> </p> <p class="p0"> <span style="font-size:12.0000pt;font-family:'宋体';">e&nbsp;such&nbsp;time.</span><span style="font-size:12.0000pt;font-family:'宋体';"></span> </p>