Problem: Recently Pashmak has been employed in a transportation company. The company has k buses and has a contract with a school which has n students. The school planned to take the students to d different places for d days (each day in one place). Each day the company provides all the buses for the trip. Pashmak has to arrange the students in the buses. He wants to arrange the students in a way that no two students become close friends. In his ridiculous idea, two students will become close friends if and only if they are in the same buses for all d days.

Please help Pashmak with his weird idea. Assume that each bus has an unlimited capacity.

Input

The first line of input contains three space-separated integers n, k, d (1 ≤ n, d ≤ 1000; 1 ≤ k ≤ 109).

Output

If there is no valid arrangement just print -1. Otherwise print d lines, in each of them print n integers. The j-th integer of the i-th line shows which bus the j-th student has to take on the i-th day. You can assume that the buses are numbered from 1 to k.

Examples

Input

3 2 2


Output

1 1 2 
1 2 1 


Input

3 2 1


Output

-1

Note

Note that two students become close friends only if they share a bus each day. But the bus they share can differ from day to day.

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.ObjectInputStream.GetField;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.StringTokenizer;

public class Main
{

	private static BufferedWriter out;


	public static void main(String[] args) throws IOException
	{
		// The input and output streams
		boolean file = false;
		BufferedReader in;
		if (file)
			in = new BufferedReader(new FileReader("input.txt"), 32768);
		else
			in = new BufferedReader(new InputStreamReader(System.in), 32768);
		out = new BufferedWriter(new OutputStreamWriter(System.out));
		StringTokenizer tok;

		// take input
		tok = new StringTokenizer(in.readLine());
		int n = Integer.parseInt(tok.nextToken());
		long k = Long.parseLong(tok.nextToken());
		int d = Integer.parseInt(tok.nextToken());
		
		long max = k;
		for (int i = 0; i < d-1; i++)
		{
			if (max > n)
				break;
			max *= k;
		}
		
		
		if (max < n)
		{
			out.write("-1\n");
		}
		else
		{
			solve(n, k, d);
		}
		out.flush();
		

	}


	private static void solve(int n, long k, int d) throws IOException
	{
		long done = 1;
		
		// add the first day
		ArrayList<Long> firstDay = new ArrayList<>();
		long curr = 1;
		for (int i = 0; i < n; i++)
		{
			firstDay.add(curr);
			curr = (curr  % k) +1;
		}
		// output it 
		StringBuilder str = new StringBuilder();
		for (Long integer : firstDay)
			str.append(integer + " ");
		out.write(str.toString().trim()+ "\n");
		
		long matched = k;
		for (int i = 1; i < d; i++)
		{
			// add the already matched
			ArrayList<Long> day = new ArrayList<>();
			curr = 1;
			for (int j = 0; j < matched && j < n; j++)
			{
				day.add(curr);
				curr = (curr  % k) +1;
			}
			
			// match the rest
			for (long j = matched; j < n; j++)
			{
				Long prev = day.get((int) (j - matched));
				day.add((prev  % k) +1);
			}
			
			if (matched < n)
				matched *= k;
			
			// output it 
			str = new StringBuilder();
			for (Long integer : day)
				str.append(integer + " ");
			out.write(str.toString().trim() + "\n");
			
		}
		
	}


	public static double round(double value, int places)
	{
		if (places < 0)
			throw new IllegalArgumentException();

		long factor = (long) Math.pow(10, places);
		value = value * factor;
		long tmp = Math.round(value);
		return (double) tmp / factor;
	}
}