#include <string>
#include <iostream>
#include <sstream>
using namespace std;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string T,P;
  cin >> T;
  cin >> P;
  for(int it=0;it<T.length();it++) {
    int s = T.find(P,it);
    if(s != string::npos) {
      cout << s << "\n";
      it = s;
    }
    else {
      return 0;
    }
  }
}
### Prompt

Please create a solution in cpp to the following problem:

Find places where a string P is found within a text T. Print all indices of T where P found. The indices of T start with 0.

Constraints

* 1 ≤ length of T ≤ 1000000
* 1 ≤ length of P ≤ 10000
* The input consists of alphabetical characters and digits

Input

In the first line, a text T is given. In the second line, a string P is given.

Output

Print an index of T where P found in a line. Print the indices in ascending order.

Examples

Input

aabaaa
aa


Output

0
3
4


Input

xyzz
yz


Output

1


Input

abc
xyz


Output

### Response

```cpp
#include <string>
#include <iostream>
#include <sstream>
using namespace std;

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);

  string T,P;
  cin >> T;
  cin >> P;
  for(int it=0;it<T.length();it++) {
    int s = T.find(P,it);
    if(s != string::npos) {
      cout << s << "\n";
      it = s;
    }
    else {
      return 0;
    }
  }
}
```