import java.util.*;

public class Main {
    static TreeSet<Integer> primes;
	public static void main (String[] args) {
		Scanner sc = new Scanner(System.in);
		long l = sc.nextLong();
		long r = sc.nextLong();
		int n = sc.nextInt();
		long[] arrL = new long[n];
		Arrays.fill(arrL, (l - 1) / n);
		long modL = (l - 1) % n;
		for (int i = 1; i <= modL; i++) {
		    arrL[i]++;
		}
		long[] arrR = new long[n];
		Arrays.fill(arrR, r / n);
		long modR = r % n;
		for (int i = 1; i <= modR; i++) {
		    arrR[i]++;
		}
		StringBuilder sb = new StringBuilder();
		for (int i = 0; i < n; i++) {
		    sb.append(arrR[i] - arrL[i]).append("\n");
		}
	    System.out.print(sb);
	}
}