import choco.kernel.model.constraints.Constraint;
import static choco.Choco.*;
import choco.cp.model.CPModel;
import choco.cp.solver.CPSolver;
import choco.kernel.model.Model;
import choco.kernel.model.variables.integer.IntegerVariable;


public class Ramsey {
	public static void main(String[] args) {

		Model m = new CPModel();
        int nNodes = Integer.parseInt(args[0]);
        int nColours = Integer.parseInt(args[1]);
        
        // linkColour is an nNodes by nNodes matrix of colours of links between nodes.
        // The colour of the link between node i and node j is linkColour[i][j]
        // The colour is represented by an integer.
        // Only the upper triangle (excluding main diagonal) will be used
        IntegerVariable[][] linkColour = new IntegerVariable[nNodes][nNodes];

        // Create upper triangular matrix of edge colours:
        for (int i=0; i<nNodes-1; i++) {
            for (int j=i+1; j<nNodes; j++) {
                linkColour[i][j] = makeIntVar("link_" + i + "_" + j, 0, nColours-1);
                m.addVariable(linkColour[i][j]);
            }
        }
        
        // Create constraints to ensure that there is no cliques of 3 nodes
        // connected by the same colour of edge.
        for (int i=0; i<nNodes-2; i++) {
            for (int j=i+1; j<nNodes-1; j++) {
                for (int k=j+1; k<nNodes; k++) {
                    Constraint c = implies(eq (linkColour[i][j],linkColour[j][k]),
                                           neq(linkColour[i][j],linkColour[i][k]));
                    m.addConstraint(c);   
                }
            }
        }
        
        // The next two for-loops reduce the search space, without loss of generality.
        // We assume that the colours of links from node 0 are in ascending order,
        // and that at least a third of them are of colour zero.
        for (int i=1; i<=nNodes/nColours; i++) {
            m.addConstraint(eq(linkColour[0][i], 0));
        }
        for (int i=nNodes/nColours; i<nNodes-1; i++) {
            m.addConstraint(or(eq(linkColour[0][i], linkColour[0][i+1]),
                               eq(plus(linkColour[0][i],1), linkColour[0][i+1]) ));
        }
        
        
        
		CPSolver s = new CPSolver();
		s.read(m);
		s.solve();

		if (!s.isFeasible()) {
			System.out.println("This puzzle doesn't have a solution.");
		} else {
            for (int i=0; i<nNodes-1; i++) {
                // Add leading spaces, because we're printing
                // the part of the matrix above the main diagonal
                System.out.print(new String(new char[i]).replace("\0", "_ "));
                System.out.print("_ ");
                for (int j=i+1; j<nNodes; j++) {
					System.out.print(s.getVar(linkColour[i][j]).getVal() + " ");
				}
				System.out.println();
			}
            for (int i=0; i<nNodes; i++) {
                System.out.print("_ ");
            }
            System.out.println("\n\n");
			s.printRuntimeSatistics();
		}
	}
}