Problem Statement  
Given an int low, an int high, and an int pow, return the sum of i^j, for all i between low and high, inclusive, and all j between 1 and pow, inclusive.  
Definition  
 
Constraints  
  low will be between 100 and 100, inclusive.  
  high will be between low and 100, inclusive.  
  pow will be between 1 and 10, inclusive.  
  The return value will fit in a signed 32 bit datatype.  
Examples  
0)  
 
1)  
 
2)  
