 This example uses two such pairs.The problem described seems very simple as described in words, but in fact is surprisingly difficult to accomplish using conventional procedural logic.The task, called the "Telegram Problem", originally described by Peter Naur, is to write a program which accepts lines of text and generates output lines containing as many words as possible, where the number of characters in each line does not exceed a certain length.