Good Permutations

You have a sequence $a$ with length $N$ created by removing some elements (possibly zero) from a permutation of numbers $(1, 2, \dots, N)$. When an element is removed, the length of the sequence doesn't change, but there is an empty spot left where the removed element was. You also have an integer $K$. Let's call a permutation $p_1, p_2, \dots, p_N$ *good* if: - it is possible replace empty spots