Running Track CodeForces

A boy named Ayrat lives on planet AMI-1511. Each inhabitant of this planet has a talent. Specifically, Ayrat loves running, moreover, just running is not enough for him. He is dreaming of making running a real art.

First, he wants to construct the running track with coating t. On planet AMI-1511 the coating of the track is the sequence of colored blocks, where each block is denoted as the small English letter. Therefore, every coating can be treated as a string.

Unfortunately, blocks aren't freely sold to non-business customers, but Ayrat found an infinite number of coatings s. Also, he has scissors and glue. Ayrat is going to buy some coatings s, then cut out from each of them exactly one continuous piece (substring) and glue it to the end of his track coating. Moreover, he may choose to flip this block before glueing it. Ayrat want's to know the minimum number of coating s he needs to buy in order to get the coating t for his running track. Of course, he also want's to know some way to achieve the answer.

Input

First line of the input contains the string s — the coating that is present in the shop. Second line contains the string t — the coating Ayrat wants to obtain. Both strings are non-empty, consist of only small English letters and their length doesn't exceed 2100.

Output

The first line should contain the minimum needed number of coatings n or -1 if it's impossible to create the desired coating.

If the answer is not -1, then the following n lines should contain two integers x_i and y_i — numbers of ending blocks in the corresponding piece. If x_i ≤ y_i then this piece is used in the regular order, and if x_i > y_i piece is used in the reversed order. Print the pieces in the order they should be glued to get the string t.

Example

Input

abc
cbaabc

Output

2
3 1
1 3

Input

aaabrytaaa
ayrat

Output

3
1 1
6 5
8 7

Input

ami
no

Output

-1

Note

In the first sample string "cbaabc" = "cba" + "abc".

In the second sample: "ayrat" = "a" + "yr" + "at".

题解：竟然是暴力加贪心，，，coma[i][j]:以b[ i ] (a[ j ] = b[ i ] ) 为起点的相同的序列的长度。comb数组同理，只不过是方向相反但序列相同(ex:abc，cba）。然后遍历b串，依次匹配。

#include<bits/stdc++.h>
using namespace std;
typedef pair<int,int> P;

const int maxn=2200;

int na,nb;
int coma[maxn][maxn],comb[maxn][maxn];
string a,b;

int main()
{   cin>>a>>b;
    na=a.size();
    nb=b.size();
    a='#'+a+'$';
    b='!'+b+'@';
    for(int i=nb;i>=1;i--){
        for(int j=na;j>=1;j--)
            if(b[i]==a[j]) coma[i][j]=coma[i+1][j+1]+1;
        for(int j=1;j<=na;j++)
            if(b[i]==a[j]) comb[i][j]=comb[i+1][j-1]+1;
    }
    vector<P> q;
    for(int i=1;i<=nb;){
        int x=max_element(coma[i]+1,coma[i]+na+1)-coma[i];
        int y=max_element(comb[i]+1,comb[i]+na+1)-comb[i];
        int len=max(coma[i][x],comb[i][y]);
        if(len==0){
            cout<<"-1"<<endl;
            return 0; 
        }
        if(len==coma[i][x])
            q.push_back(P(x,x+len-1));
        else
            q.push_back(P(y,y-len+1));
        i=i+len;
    }
    cout<<q.size()<<endl;
    for(int i=0;i<q.size();i++) cout<<q[i].first<<" "<<q[i].second<<endl;
    return 0;
}