View Code of Problem 3832

#include<iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<climits>
#include<cmath>
#include<map>
#include<set>
#include<queue>

using namespace std;


int main()
{
	string a, b;
	while (cin >> a >> b) {

		if (a.find(b) == a.npos)
			cout << -1 << endl;
		else
			cout << a.find(b) + 1 << endl;
	}
}