PROGRAMMING:I won't say it even if I'm killed!
Terrier: what's the best code? It's "beat me to death and don't say it!" In this way, we don't have to worry about divulging secrets even if our pig teammates who help us transmit the code are caught and tortured by the enemy.
Now for a little improvement, we hide the initials "dswybs" in a matrix, and the sum of the subscripts of "d" for "Da" and "s" for "Shuo" is the password.
For a given matrix, please judge whether there is "dswybs" hidden in it. If so, give the subscripts of the first and last two letters and calculate the password; If not, print a line of "dswybs".
be careful:
*If there is "dswybs", the letters must be arranged along the row, column or inclined 45 degrees.
*The topic ensures that the input matrix contains at most a string of "dswybs".
*The subscript of the upper left corner of the matrix is (0,0).
*Case sensitive.
*The title ensures that the input matrix does not contain an arrangement like this (that is, there are only five letters of dswyb, but the letter B is adjacent to s, which can form an arrangement of dswybs)
```
DSB
WY
```
###Input format:
The first line gives two integers'm 'and' n '(no more than 15 and no less than 4). The next M line has n letters or numbers in each line, ending with a new line.
###Output format:
If "dswybs" is hidden in the input matrix, three lines will be output. The first line and the second line are the subscripts of the first letter'd 'and the last letter's', respectively. The first line subscript is followed by the second column subscript, separated by a space. The third line gives the sum of two letters and four subscripts.
If the string is not hidden, print a line of "dswybs"
###Input sample 1:
```in
8 10
0x00z000d0
00aD00s000
00b0SWk000
000wcY000s
00000B0000
0000S00000
0000000000
0000000000
```
###Output sample 1:
```out
1 3
5 4
thirteen
```
###Input sample 2:
```
5 5
twelve thousand three hundred and forty-five
adswa
fifty-four thousand three hundred and twenty-one
dswys
aaaaa
```
###Output sample 2:
```
DSWYBS
```
answer：If there is no answer, please comment
Now for a little improvement, we hide the initials "dswybs" in a matrix, and the sum of the subscripts of "d" for "Da" and "s" for "Shuo" is the password.
For a given matrix, please judge whether there is "dswybs" hidden in it. If so, give the subscripts of the first and last two letters and calculate the password; If not, print a line of "dswybs".
be careful:
*If there is "dswybs", the letters must be arranged along the row, column or inclined 45 degrees.
*The topic ensures that the input matrix contains at most a string of "dswybs".
*The subscript of the upper left corner of the matrix is (0,0).
*Case sensitive.
*The title ensures that the input matrix does not contain an arrangement like this (that is, there are only five letters of dswyb, but the letter B is adjacent to s, which can form an arrangement of dswybs)
```
DSB
WY
```
###Input format:
The first line gives two integers'm 'and' n '(no more than 15 and no less than 4). The next M line has n letters or numbers in each line, ending with a new line.
###Output format:
If "dswybs" is hidden in the input matrix, three lines will be output. The first line and the second line are the subscripts of the first letter'd 'and the last letter's', respectively. The first line subscript is followed by the second column subscript, separated by a space. The third line gives the sum of two letters and four subscripts.
If the string is not hidden, print a line of "dswybs"
###Input sample 1:
```in
8 10
0x00z000d0
00aD00s000
00b0SWk000
000wcY000s
00000B0000
0000S00000
0000000000
0000000000
```
###Output sample 1:
```out
1 3
5 4
thirteen
```
###Input sample 2:
```
5 5
twelve thousand three hundred and forty-five
adswa
fifty-four thousand three hundred and twenty-one
dswys
aaaaa
```
###Output sample 2:
```
DSWYBS
```
answer：If there is no answer, please comment