You are given positive integer number n. You should create such strictly increasing sequence of k positive numbers a1, a2, ..., ak, that their sum is equal to n and greatest common divisor is maximal.

Greatest common divisor of sequence is maximum of such numbers that every element of sequence is divisible by them.

If there is no possible sequence then output -1.

Input

The first line consists of two numbers n and k (1 ≤ n, k ≤ 1010).

Output

If the answer exists then output k numbers — resulting sequence. Otherwise output -1. If there are multiple answers, print any of them.

Examples

Input

6 3


Output

1 2 3


Input

8 2


Output

2 6


Input

5 3


Output

-1
import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.StringTokenizer;

/*
 public class _803C {

 }

 */

public class _803C
{
	public void solve() throws FileNotFoundException
	{
		InputStream inputStream = System.in;

		InputHelper inputHelper = new InputHelper(inputStream);

		PrintStream out = System.out;

		// actual solution
		long n = inputHelper.readLong();
		long k = inputHelper.readLong();

		if (k > (long) 1e6)
		{
			System.out.println("-1");
			return;
		}

		long ans = -1;
		long ansl = -1;

		for (long i = 1; i * i <= n; i++)
		{
			if (n % i == 0)
			{
				long ci = i;
				long cn = n / ci;
				if (((k * (k + 1)) / 2) <= cn)
				{
					if (ans < ci)
					{
						ans = ci;

						ansl = k * ci + (cn - (k * (k + 1)) / 2) * ci;
					}
				}

				ci = n / i;
				cn = n / ci;
				if (((k * (k + 1)) / 2) <= cn)
				{
					if (ans < ci)
					{
						ans = ci;

						ansl = k * ci + (cn - (k * (k + 1)) / 2) * ci;
					}
				}
			}
		}

		if (ans == -1)
			System.out.println("-1");
		else
		{
			for (int i = 1; i < k; i++)
				System.out.print(ans * i + " ");
			System.out.println(ansl);
		}
		// end here
	}

	public static void main(String[] args) throws FileNotFoundException
	{
		(new _803C()).solve();
	}

	class InputHelper
	{
		StringTokenizer tokenizer = null;
		private BufferedReader bufferedReader;

		public InputHelper(InputStream inputStream)
		{
			InputStreamReader inputStreamReader = new InputStreamReader(
					inputStream);
			bufferedReader = new BufferedReader(inputStreamReader, 16384);
		}

		public String read()
		{
			while (tokenizer == null || !tokenizer.hasMoreTokens())
			{
				try
				{
					String line = bufferedReader.readLine();
					if (line == null)
					{
						return null;
					}
					tokenizer = new StringTokenizer(line);
				}
				catch (IOException e)
				{
					e.printStackTrace();
				}
			}

			return tokenizer.nextToken();
		}

		public Integer readInteger()
		{
			return Integer.parseInt(read());
		}

		public Long readLong()
		{
			return Long.parseLong(read());
		}
	}
}