PROBLEM $-$ EXPONENTS

Write an assembler program that reads two positive integers, $x$ and $y,$ and prints $x$ to the $y$ power. Your program should continue asking for integers until it has received two positive, nonzero numbers. You may assume that overflow and underflow do NOT occur.

Example:

$?2$

$?30$

$1073741824$