PROGRAMMING:Cubic sum of integers
###Task description
Given a positive integer k (1 < K < 10), find the cubic sum m from 1 to K. That is, M = 1 + 2 * 2 * 2 +... + k * k * K.
###Input format:
The input has only one line, which contains a positive integer K.
###Output format:
The output has only one line, which contains the sum of cubes from 1 to K.
###Input example:
```in
five
```
###Output example:
```out
two hundred and twenty-five
```
###Title Source
Note: selected from openjudge website, online address: http://sdau.openjudge.cn/c/005/
###Problem analysis
```
This problem first reads integer n, and then accumulates the sum of cubes from 1 to N through N cycles. The algorithm designed for this problem is as follows.
(1) The algorithm begins
(2) Read in the integer n, I = 1, s = 0
(3) If I > N, go to (6)
(4)s=s+i*i*i
(5)i=i+1
(6) Output s
(7) End of algorithm
```
answer：If there is no answer, please comment
Given a positive integer k (1 < K < 10), find the cubic sum m from 1 to K. That is, M = 1 + 2 * 2 * 2 +... + k * k * K.
###Input format:
The input has only one line, which contains a positive integer K.
###Output format:
The output has only one line, which contains the sum of cubes from 1 to K.
###Input example:
```in
five
```
###Output example:
```out
two hundred and twenty-five
```
###Title Source
Note: selected from openjudge website, online address: http://sdau.openjudge.cn/c/005/
###Problem analysis
```
This problem first reads integer n, and then accumulates the sum of cubes from 1 to N through N cycles. The algorithm designed for this problem is as follows.
(1) The algorithm begins
(2) Read in the integer n, I = 1, s = 0
(3) If I > N, go to (6)
(4)s=s+i*i*i
(5)i=i+1
(6) Output s
(7) End of algorithm
```
answer：If there is no answer, please comment