Armstrong Number Problem Statement

You are provided an integer 'NUM'. Determine if 'NUM' is an Armstrong number.

Explanation:

An integer 'NUM' with 'k' digits is an Armstrong number if the sum of its digits, each raised to the power of 'k', equals the number itself.

Input:

T, followed by T values of NUM

Output:

For each NUM, output 'YES' if it's an Armstrong number, 'NO' otherwise.

Example:

Input:
2
153
123
Output:
YES
NO
Explanation: '153' is an Armstrong number, whereas '123' is not.

Constraints:

• 1 <= T <= 100
• 1 <= NUM <= 10^9
• Time Limit: 1 sec

Note:

Just implement the function as described; printing is handled for you.