I want an algorithm to list all possible ways to map a series of integers $M = \{1,2,3,...,m\}$ to another series of integers $N = \{1,2,3,...,n\}$ where $m > n$, subject to the constraint that only contiguous integers in $M$ map to the same integer in $N$. E.g.: 5 -> 2:  (1, 2, 3, 4), (5)  (1), (2, 3, 4, 5)  (1, 2, 3), (4, 5)  (1, 2), (3, 4, 5)This seems like it should be a standard problem with a well known solution, but I can't find it. To clarify, I am not looking for the total number of solutions, but for pseudocode or the name of a corresponding algorithm to exhaustively list all solutions. 
Enumerate all ways to bin a series of integers into N bins, where each bin only contains contiguous numbers
algorithms;enumeration