import java.io.*;

class PowerRec1a
{
 public static void main(String[] args)
 throws IOException
 {
  int n,m;
  BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
  System.out.print("Enter number n : ");
  n = Integer.parseInt(in.readLine());
  System.out.print("Enter number m : ");
  m = Integer.parseInt(in.readLine());
  System.out.print(n+" to the power of "+m+" is: ");
  System.out.println(power(n,m));
 }

 public static int power(int n, int m)
 // Calculate n to the power of m using tail recursion
 {
  return power(n,m,1);
 }

 private static int power(int n, int m,int acc)
 // This is the tail recursive method
 {
  if(m==0)
     return acc;
  else
     return power(n,m-1,acc*n);
 }
}