PROGRAMMING:Broken Pad
*The party began, the greasy uncle was playing cards, the fat otaku was eating, and the little beauty was drawing.*
Playing cards is an indispensable and irreplaceable activity for parties. In order to be more impartial and prevent magician $$YHH$$ from cheating when shuffling cards, and give full play to his mind-reading advantages at the same time, psychologist $$ZH$$ proposed to use a pad to play cards.
However, $$ZH$$ found that the touch screen of the pad he was assigned was malfunctioning. Every time he clicked a card, this card and **all the cards behind it** would be selected. As we all know, the effect of choosing a card is equivalent to changing the state of the card, that is, if the card was initially selected, it would become unselected, and if it was unselected, it would become selected. Besides, there is another operation, which is to click on the blank space, so that all the cards will become unselected.
Now $$ZH$$ needs to select some cards to play, but due to the malfunctioning of the touch screen, he cannot simply choose the cards he wants to choose. Now he has used the blind trick to secretly ask netizens which positions to click to choose the cards he wants, please help him!
Given two $$01$$-strings $$a$$ and $$b$$, which represent the current state of the card and the state required by $$ZH$$. $$0$$ represents unselected, and $$1$$ represents selected. Now you are asked to give a plan with the smallest number of tap times.
### Input Specification:
There are multiple test cases. The first line of input contains an integer $$T$$ ($$1$$ ≤ $$T$$ ≤ $$10$$), indicating the number of test cases. For each test case:
The first line contains a string $$a$$ ($$1$$ ≤ $$|a|$$ ≤ $$10^5$$), indicating the current state of the card.
The second line contains a string $$b$$ ($$|b| = |a|$$), indicating the state required by $$ZH$$.
### Output Specification:
For each test case, print one line contains the minimum number of integers indicating the position $$ZH$$ should tap in non-decreasing order.
**Please note that number $$0$$ is indicating the blank space, and it's guaranteed that the solution of all the test cases is unique.**
### Sample Input:
```in
two
ten thousand one hundred and ten
ten thousand
one hundred and ten thousand one hundred and one
000000
```
### Sample Output:
```out
3 5
0
```
### Hint:
For the first sample, $$a$$ is "$$10110$$", and $$b$$ is "$$10000$$", then $$ZH$$ needs first to tap the position $$3$$ (based on $$1$$) to make the state become "$$10001$$", and then tap the position $$5$$ to make the state become "$$10000$$", so you should tell him $$3$$ and $$5$$.
answer：If there is no answer, please comment
Playing cards is an indispensable and irreplaceable activity for parties. In order to be more impartial and prevent magician $$YHH$$ from cheating when shuffling cards, and give full play to his mind-reading advantages at the same time, psychologist $$ZH$$ proposed to use a pad to play cards.
However, $$ZH$$ found that the touch screen of the pad he was assigned was malfunctioning. Every time he clicked a card, this card and **all the cards behind it** would be selected. As we all know, the effect of choosing a card is equivalent to changing the state of the card, that is, if the card was initially selected, it would become unselected, and if it was unselected, it would become selected. Besides, there is another operation, which is to click on the blank space, so that all the cards will become unselected.
Now $$ZH$$ needs to select some cards to play, but due to the malfunctioning of the touch screen, he cannot simply choose the cards he wants to choose. Now he has used the blind trick to secretly ask netizens which positions to click to choose the cards he wants, please help him!
Given two $$01$$-strings $$a$$ and $$b$$, which represent the current state of the card and the state required by $$ZH$$. $$0$$ represents unselected, and $$1$$ represents selected. Now you are asked to give a plan with the smallest number of tap times.
### Input Specification:
There are multiple test cases. The first line of input contains an integer $$T$$ ($$1$$ ≤ $$T$$ ≤ $$10$$), indicating the number of test cases. For each test case:
The first line contains a string $$a$$ ($$1$$ ≤ $$|a|$$ ≤ $$10^5$$), indicating the current state of the card.
The second line contains a string $$b$$ ($$|b| = |a|$$), indicating the state required by $$ZH$$.
### Output Specification:
For each test case, print one line contains the minimum number of integers indicating the position $$ZH$$ should tap in non-decreasing order.
**Please note that number $$0$$ is indicating the blank space, and it's guaranteed that the solution of all the test cases is unique.**
### Sample Input:
```in
two
ten thousand one hundred and ten
ten thousand
one hundred and ten thousand one hundred and one
000000
```
### Sample Output:
```out
3 5
0
```
### Hint:
For the first sample, $$a$$ is "$$10110$$", and $$b$$ is "$$10000$$", then $$ZH$$ needs first to tap the position $$3$$ (based on $$1$$) to make the state become "$$10001$$", and then tap the position $$5$$ to make the state become "$$10000$$", so you should tell him $$3$$ and $$5$$.
answer：If there is no answer, please comment