public class Powers
{ 
    public static void main(String[] args);
 
        int input;
        int numOneTensLow = 10;
        int numTwoTensLow = 20;
        int numThreeTensLow = 30;
        int numOneOnesLow = 4;
        int numTwoOnesLow = 5;
        int numThreeOnesLow = 6;
        int numOneTensHigh = 90;
        int numTwoTensHigh = 80;
        int numThreeTensHigh = 70;
        int numOneOnesHigh = 6;
        int numTwoOnesHigh = 5;
        int numThreeOnesHigh = 4;
        int numOneLow;
        int numTwoLow;
        int numThreeLow;
        int numOneHigh;
        int numTwoHigh;
        int numThreeHigh;
        int lowproduct = (numOneLow * numTwoLow * numThreeLow);
        int highprodcut = (numOneHigh * numTwoHigh * numThreeHigh);
 
        ConsoleIO console = new ConsoleIO();
        System.out.println("This program will calculate three two-digit" +
        " numbers that create the lowest and highest possible products " +
        "using the numbers 1 through 9 once in each.");
        System.out.println("To calculate the highest input 1, to calculate" +
        " the lowest, input 0: ");
        input = console.readInt();
 
        if(int input = 0);
        {
            do
            {
                numOneTensLow + NumOneOnesLow;
                numTwoTensLow + NumTwoOnesLow;
                numThreeTensLow + NumThreeOnesLow;
                System.out.println((numOneTensLow + numOneOnesLow) * (NumTwoTensLow + NumTwoOnesLow)
                * (NumThreeTensLow + NumThreeOnesLow));
                }
            }

public static void main(String[] args);

highProduct1 = (numOneTensHigh + numOneOnesHigh) * 
					(numTwoTensHigh + numTwoOnesHigh) * 
					 (numThreeTensHigh + numThreeOnesHigh);
 
	highProduct2 = (numOneTensHigh + numTwoOnesHigh) * 
				    (numTwoTensHigh + numOneOnesHigh) * 
					 (numThreeTensHigh + numThreeOnesHigh);
 
	highProduct3 = (numOneTensHigh + numThreeOnesHigh) * 
					(numTwoTensHigh + numTwoOnesHigh) * 
					 (numThreeTensHigh + numOneOnesHigh);
 
	highProduct4 = (numOneTensHigh + numOneOnesHigh) * 
    				(numTwoTensHigh + numThreeOnesHigh) * 
    				 (numThreeTensHigh + numTwoOnesHigh);
 
	// This way try all combinations, if there are left any others ;-)
	// then get the max of them.
 
	if (max < highProduct1)
		max = highProduct1;
 
	if (max < highProduct2)
		max = highProduct2;
 
	if (max < highProduct3)
		max = highProduct3;
 
	if (max < highProduct4)
		max = highProduct4;
 
	// In the end print out the highest product
	System.out.println("Highest product is : " + max);

if(int input = 0);