In this paper, starting with a simply laced root system, we define a triangulated category which we call the m-cluster category, and we show that it encodes the combinatorics of the m-clusters of Fomin and Reading in a fashion similar to the way the cluster category of Buan, Marsh, Reineke, Reiten, and Todorov encodes the combinatorics of the clusters of Fomin and Zelevinsky. For Φ any root sys...