Loops Complexity Analysis

for (int i = k; i < n; i = i + m)
{
statement1;
statement2;
}
From the above loop, there are three facts taken! I have understood the first one. But Ca’t understand the rest of 3. Can anyone explain those? Thanks! Here are those:
1)The initialization statement, i = k, is executed one time.

2)The condition, i < n, is executed (n – k) / m + 1 times.

3)The update statement, i = i + m, is executed (n – k) / m times.

  1. Each of statement1 and statement2 is executed (n – k) / m times.