#include "stdio.h"
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;



class Puzzle
{
public:
	string T;
	string P;

	void input()
	{
		cin >> T;
		cin >> P;

	}

	void play()
	{
		if (T.size() < P.size()) return;

		for (int si = 0; si <= (T.size() - P.size()); si++) {
			if (T.substr(si, P.size()) == P) {
				cout << si << "\n";
			}
		}
	}

};


int main()
{
	Puzzle puz;

	puz.input();
	puz.play();

    return 0;
}



### Prompt

Create a solution in Cpp for 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 "stdio.h"
#include <vector>
#include <string>
#include <iostream>
#include <algorithm>

using namespace std;



class Puzzle
{
public:
	string T;
	string P;

	void input()
	{
		cin >> T;
		cin >> P;

	}

	void play()
	{
		if (T.size() < P.size()) return;

		for (int si = 0; si <= (T.size() - P.size()); si++) {
			if (T.substr(si, P.size()) == P) {
				cout << si << "\n";
			}
		}
	}

};


int main()
{
	Puzzle puz;

	puz.input();
	puz.play();

    return 0;
}



```