3. In city "N", there are 7 horizontal and 13 vertical streets, of which a pair of horizontal and a pair of vertical streets form the rectangular boundary of the city, while the rest divide it into blocks that are squares with a side length of 100 m. Each block has an address consisting of two integers $(i ; j), i=1,2, . ., 6, j=1,2, \ldots, 12$ - the numbers of the streets that bound it from below and from the left. Taxis transport passengers from one block to another, adhering to the following rules: 1) pick-up and drop-off can be made at any point on the boundary of the block at the passenger's request; 2) it is forbidden to enter inside the block; 3) transportation is carried out along the shortest path; 4) a fee of 1 coin is charged for every 100 m traveled (rounding the distance to the nearest 100 m in favor of the driver). How many blocks are there in the city? What is the maximum and minimum fare that the driver can charge the passenger for a ride from block $(4,2)$ to block $(1 ; 9)$ without violating the rules.
# Answer: 72 blocks; $c_{\min }=8$ coins, $c_{\max }=12$ coins.