{"trustable":true,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cimg src\u003d\"CDN_BASE_URL/ac7afc730f5b1c76c3e55afcb27886bf?v\u003d1714252662\" border\u003d\"0\" alt\u003d\"Problem illustration\" align\u003d\"RIGHT\" class\u003d\"problem_raimage\"\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eWhile Fedya was writing the statement of the problem \u003ci\u003e GOV Chronicles\u003c/i\u003e, \r\nhe realized that there might be not enough paper to print the statements. \r\nHe also discovered that his text editor didn\u0027t have the feature of \r\ncalculating the number of pages in a text. Then Fedya decided to write a \r\nprogram that would calculate the number of pages for any given text.\u003c/div\u003e\u003c/div\u003e\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eFedya knew that there were \u003ci\u003eh\u003c/i\u003e lines on each page and \u003ci\u003ew\u003c/i\u003e symbols in each \r\nline. Any two neighboring words in a line were separated by exactly one \r\nspace. If there was no place for a word in a line, Fedya didn\u0027t hyphen it \r\nbut put the whole word at the beginning of the next line. \u003c/div\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eThe first line contains the integers \u003ci\u003eh\u003c/i\u003e, \u003ci\u003ew\u003c/i\u003e, and \u003ci\u003en\u003c/i\u003e, which are the \r\nnumber of lines on a page, the number of symbols in a line, and the number \r\nof words in the problem statement, respectively (1 ≤ \u003ci\u003eh\u003c/i\u003e, \u003ci\u003ew\u003c/i\u003e ≤ 100; 1 ≤ \u003ci\u003en\u003c/i\u003e ≤ 10\u0026nbsp;000). The statement written by Fedya is \r\ngiven in the following \u003ci\u003en\u003c/i\u003e lines, one word per line. The words are \r\nnonempty and consist of uppercase and lowercase English letters and \r\npunctuation marks (period, comma, exclamation mark, and question mark); \r\nthe length of each word is at most\u0026nbsp;\u003ci\u003ew\u003c/i\u003e. The total length of all the words \r\nis at most\u0026nbsp;10\u0026nbsp;000. \u003c/div\u003e\u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"problem_par\"\u003e\u003cdiv class\u003d\"problem_par_normal\"\u003eOutput the number of pages in the problem statement.\u003c/div\u003e\u003c/div\u003e"}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 5 6\r\nTo\r\nbe\r\nor\r\nnot\r\nto\r\nbe\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}