If by "$4$-permutations" you mean a selection of $4$ elements in order (which your note suggests), then it is asking the following:
First, suppose you want to figure out in how many ways you can pick four positive integers, not exceeding $100$, in a way where the order matters. Then you have 100 choices for the first integer; 99 for the second; 98 for the third, and 97 for the fourth; i.e., $P(100,4)$.
In some of these selections, there will be absolutely no relation between the chosen integer. You can pick $17$, then $84$, then $53$, and finally $8$.
But some of the selections have three consecutive integers in order: for example, you can pick $11$, $12$, $13$, and $85$, where the first three are in order; or $7$, $71$, $72$, $73$, where the last three are in order.
The question is asking you to count only those selections of 4 positive integers between 1 and 100 in which (at least) three of the selected integers are in their usual order, $k$, $k+1$, and $k+2$. They can be the first three, or the last three that you pick.
My suggestion: Count how many have the first three in order; then count how many have the last three in order; then use inclusion-exclusion to account for possible overcounting when you have all four numbers in their usual order.
Added. Given the answer you have, I am guessing that:
- You want at least 3 in order; if all four are in order, that counts too.
- They must appear consecutively and in order, so that 8,9,10,47 counts, but 8,47,9,10 does not (even though it contains three consecutive integers, listed in the correct order, namely 8,9,10).
At least, by counting those, I get the answer you were given.