// NM i programmering 2001
// Løsningsforslag til oppgave G
// Skrevet av Mildrid Ljosland (mildrid@aitel.hist.no)

import java.io.*;
import java.util.*;

class G {
	Bridge br;
	int[] answer;
	int minimum;

	G(int a, int b, int n) {
		if (a>=b) br=new Bridge(a,b,n);
		else br = new Bridge(b,a,n);
		answer=new int[n];
	}

	public static void main(String args[]) {
		try {
			BufferedReader inFile=new BufferedReader(new FileReader("bridge.in"));
			PrintWriter outFile=new PrintWriter(new FileWriter("bridge.out")); 
			String line=null;
			StringTokenizer st=null;
			int a;
			while ((a=new Integer((st=new StringTokenizer(inFile.readLine())).nextToken()).intValue())>=0) {
				int b=new Integer(st.nextToken()).intValue();
				int n=new Integer(st.nextToken()).intValue();
				G ans=new G(a,b,n);
				ans.produceAnswer();
				ans.reportAnswer(outFile);
			}
			inFile.close();
			outFile.close();
		}
		catch (Exception e) {
			System.out.println(e);
		}
	}

	void produceAnswer() {
		int n=br.noOfBr;
		int highest=br.heightB;
		boolean OK=false;
		double interval=0;
		minimum=Integer.MAX_VALUE;
		while (!OK) {
			highest--;
			interval=(double)highest/(double)n;
			for (int i=1;i<=n;i++) {
				br.brLevels[i]=(int)(i*interval+0.000001);
			}
			int thisTry=br.findTotalSteps();
			if (thisTry < minimum) {
				minimum=thisTry;
				for (int i=0;i<n;i++) {
					answer[i]=br.brLevels[i+1];
				}
			}
			else if (thisTry==minimum) {
				int i=0;
				while (i<n&&answer[i]==br.brLevels[i+1]) i++;
				if (i<n&&br.brLevels[i+1]<answer[i]) {
					for (int j=0;j<n;j++) {
						answer[j]=br.brLevels[j+1];
					}
				}
			}
			else OK=true;
		}
	}

	void reportAnswer(PrintWriter outFile) {
		outFile.println(minimum);
		for (int i=0;i<br.noOfBr;i++) {
			outFile.print(answer[i]+" ");
		}
		outFile.println();
	}

}
 class Bridge {
 	int heightA;
	int heightB;
	int noOfBr;
	int[] brLevels;

	Bridge(int a, int b, int n) {
		heightA=a;
		heightB=b;
		noOfBr=n;
		brLevels=new int[noOfBr+2];  //n bridges + ground level + nonreal stop value
		for (int i=0;i<noOfBr+1;i++) brLevels[i]=i;
		brLevels[noOfBr+1]=3*a;  
	}

 	int findSteps(int x, int y, int b1, int b2) {
		// x and y: levels of start and finish
		// b1 and b2: bridge levels, upper and lower
		// result: minimum number of steps that have to be used

		if (x>=b1 && y>=b1) return (x-b1)+(y-b1);
		else if (x<=b2 && y<=b2) return (b2-x)+(b2-y);
		else if (x<b1 && x>b2 && y<b1 && y>b2) {
			int t1 = (b1-x)+(b1-y);
			int t2 = (x-b2)+(y-b2);
			if (t1<t2) return t1; else return t2;
		}
		else if (x>=y ) return x-y;
		else return y-x;
	}

	int findTotalSteps() {
		int sum=0;
		int bNr=0;
		for (int i=0;i<heightA;i++) {
			if (i>=brLevels[bNr]) bNr++;
			for (int j=0;j<heightB;j++) {
				int h=findSteps(i,j,brLevels[bNr],brLevels[bNr-1]);
				sum+=h;
			}
		}
		return sum;
	}
}