PROGRAMMING:The largest 10 primes less than m
Given an integer m (50 < m < 20000), find the largest 10 primes less than m.
###Input format:
The input gives a positive integer m (50 < m < 20000) in one line.
###Output format:
In a row, 10 prime numbers satisfying the conditions are output in descending order, and each prime number output occupies 6 columns. There are no additional formats and characters.
###Input example:
```in
two hundred and twenty-nine
```
###Output example:
```out
227 223 211 199 197 193 191 181 179 173
```
###Thank you for correcting the data< br>
answer：If there is no answer, please comment
###Input format:
The input gives a positive integer m (50 < m < 20000) in one line.
###Output format:
In a row, 10 prime numbers satisfying the conditions are output in descending order, and each prime number output occupies 6 columns. There are no additional formats and characters.
###Input example:
```in
two hundred and twenty-nine
```
###Output example:
```out
227 223 211 199 197 193 191 181 179 173
```
###Thank you for correcting the data< br>
answer：If there is no answer, please comment