#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
namespace ztd{
    using namespace std;
    typedef long long ll;
    template<typename T> inline T read(T& t) {
        t=0;short f=1;char ch=getchar();
        while (ch<'0'||ch>'9') {if (ch=='-') f=-f;ch=getchar();}
        while (ch>='0'&&ch<='9') t=t*10+ch-'0',ch=getchar();
        t*=f; return t;
    }
}
using namespace ztd;
const int maxn = 1e5+7;
char s[maxn], t[maxn];
int n, m, o, p, pos[maxn], inbl[maxn];
struct node{int l, r;} a[maxn];
inline void NO(){
	puts("NO");
	exit(0);
}
inline void YES(){
	puts("YES");
	for(int i = 1; i <= m; ++i) cout << pos[i] << ' ';
	exit(0);
}
signed main(){
	scanf("%s\n%s",s+1,t+1);
	n = strlen(s+1); m = strlen(t+1);
	for(int i = 1; i <= n; ++i){
		int cnt = 1, j;
		for(j = i; j <= n; ++j){
			if(j == n || s[j+1] != s[i]) break;
		}
		a[++o] = (node){i, j};
		for(int p = i; p <= j; ++p) inbl[p] = o;
		i = j;
	}
	pos[0] = 0;
	for(int i = 1; i <= n; ++i){
		if(s[i] == t[p+1]) pos[++p] = i;
	}
	if(p < m) NO(); 
	pos[p+1] = n+1;
	for(int i = m; i >= 1; --i){
		if(inbl[pos[i]+1] == inbl[pos[i+1]-1]) YES();
		pos[i] = a[inbl[pos[i+1]-1]].l;
		if(s[pos[i]] != t[i]) --pos[i];
	}
	if(inbl[pos[1]-1] == 1) YES();
	else NO();
    return 0;
}