#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;

int table[256];//char 8 bits
char pattern[1000000];//模式串
char target[1000000];//目标串

void shifttable(){
    //important
    int n = strlen(pattern);
    for (int i = 0; i < 256; i++){
        table[i] = n;
    }
    for (int i = 0; i < n - 1; i++){
        table[pattern[i]] = n - i - 1;
    }
}

//String Matching --Horspool Algorithm
void Boyer_Moore(){
    shifttable();
    int n = strlen(pattern);
    int m = strlen(target);
    int i = n - 1;
    int k = n - 1;
    while (i < m){
        int pos = i;
        while (target[pos] == pattern[k]){
            if (k == 0){
                cout << pos << endl;
                return;
            }
            pos--;
            k--;
        }
        i += table[target[i]];
        k = n - 1;
    }
    cout << "no solution" << endl;
}

int main(){
    while (cin >> target){
        cin >> pattern;
        Boyer_Moore();
    }
    return 0;
}