Find the smallest and largest hexadecimal integers such that each of their squares contains each of the 16 hexadecimal digits (0 through 9 and A through F) once and only once. A leading zero is not allowed.