#include<bits/stdc++.h>

using namespace std;
string s, t;
int n, m;
bool vis[110000];
int L[110000], R[110000];

void myfill(int x, int tot, char col) {
    while (tot--) {
        while (vis[x] || s[x] != col) x++;
        vis[x++] = true;
//        cerr << x << ' ';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    cin >> s;
    n = s.length();
    cin >> t;
    m = t.length();

    int l = -1, r = -1;
    for (int i = 0, j = 0; i < m; i = j) {
        char c = t[i];
        while (j < m && t[j] == t[i]) j++;
        for (int k = 0; k < j - i; k++) {
            if (l < n) {
                l++;
                while (l < n && s[l] != c) l++;
            }
            if (r < n) {
                r++;
                if (r < n) {
                    if (s[r] == c)
                        while (r + 1 < n && s[r + 1] == c) r++;
                    else
                        while (r < n && s[r] != c) r++;
                }
            }
        }
        L[j] = l;
        R[j] = r;
    }
    if (l == n) {
        cout << "NO\n";
        return 0;
    }
    if (r < n) {
        r++;
        while (r + 1 < n && s[r + 1] == s[r]) r++;
        if (r < n - 1) {
            cout << "NO\n";
            return 0;
        }
    }
    cout << "YES\n";
    int x = n;
    while (s[x - 1] != t[m - 1]) x--;

    bool flg = false;
    for (int i = m - 1, j = m - 1; i >= 0; i = j) {
        char c = t[i];
        while (j >= 0 && t[j] == t[i]) j--;
        if (flg) {
            myfill(L[j + 1], i - j, c);
            continue;
        }
        for (int k = 0; k < i - j; k++) {
            x--;
            if (s[x] == c)
                while (s[x - 1] == c) x--;
            else
                while (s[x] != c) x--;
            if (x < L[j + 1]) {
                myfill(L[j + 1], i - j - k, c);
                flg = true;
                break;
            }
            vis[x] = true;
        }
    }

    for (int i = 0; i < n; i++)
        if (vis[i]) cout << i + 1 << ' ';
    return 0;
}