I need to find the possible permutations (hope that is the right terminology) given a set of items N where order is important and I'm looking for permutations with M number of consecutive items from N while also satisfying the condition that the number of pairings must be P.
An example of this would be having N=4 items 1,2,3,4 and needing to pair these into P=3 groups whil resepcting the order, this would give [1 , 2-3, 4], [1-2 ,3 ,4], [1 , 2 , 3-4].
M here can only be 1 or 2 if I have this right.
If I understand the question what you have to do is choose $P-1$ places in the list $$ 1-2-3 - \cdots - N $$ where you change the $-$ to a $,$ to build the list of groups (in your notation).
So the answer is the binomial coefficient $\binom{N-1}{P-1}$
For example, if $P=4$ and $N=7$ there will be $\binom{6}{3} = 20$ ways. One of them is $$ 1 - 2 , 3 - 4 - 5 , 6, 7 $$
You can look up binomial coefficient in wikipedia.