Cat starts his journey on the plane from point with coordinates (0; 0) and wants to reach point with coordinates (n; m). From point (x; y) with one step cat can either reach point (x+1; y) or point (x; y+1). Find the number of different paths from start to destination, when n = 6 and m = 4...