A rectangular city is divided by streets into squares. There are n such squares from north to south and k squares from east to west. Find the number of shortest walks from the north-eastern end of the city to the south-western end.
A rectangular city is divided by streets into squares. There are n such squares from north to south and k squares from east to west. Find the number of shortest walks from the north-eastern end of the city to the south-western end.










