#include <bits/stdc++.h>
using namespace std;

#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define ll long long

int main()
{
    ios;

    string str;
    string str1;

    cin>>str;
    cin>>str1;

    int len = str.size() - str1.size() + 1;

    for(int i=0; i<len; i++)
    {
        i = str.find(str1,i);
        if(i != string::npos)
        {
            cout<<i<<endl;
        }
        else
        {
           return 0;
        }
    }

    return 0;
}


### Prompt

In CPP, your task is to solve 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 <bits/stdc++.h>
using namespace std;

#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define endl "\n"
#define ll long long

int main()
{
    ios;

    string str;
    string str1;

    cin>>str;
    cin>>str1;

    int len = str.size() - str1.size() + 1;

    for(int i=0; i<len; i++)
    {
        i = str.find(str1,i);
        if(i != string::npos)
        {
            cout<<i<<endl;
        }
        else
        {
           return 0;
        }
    }

    return 0;
}


```