#include <bits/stdc++.h>

using namespace std;

const int N = 1e5 + 10;

int n, m;
int l[N], r[N], f[N];
char a[N], b[N];

int Find(int x) {
	if (f[x] != x) f[x] = Find(f[x]);
	return f[x];
}

bool check(int x, char c, int id) {
	if (a[x + 1] == c) return true;
	else if (Find(x + 1) != n) return true;
	else return false;
}

int main() {
	scanf("%s%s", a + 1, b + 1);
	n = strlen(a + 1), m = strlen(b + 1);
	
	for (int i = 1; i <= n; i ++) f[i] = i;
	for (int i = n - 1; i >= 1; i --) {
		int fx = Find(i), fy = Find(i + 1);
		if (a[i] == a[i + 1]) f[fx] = fy;
	}
	
	if (a[1] == b[1]) {
		l[1] = 1;
		for (int i = 1; i <= n; i ++) {
			if (a[i] == b[1]) r[1] = i;
			else break;
		}
	}
	else {
		for (int i = 1; i <= n; i ++) {
			if (a[i] == b[i]) {
				l[1] = r[1] = i;
				break;
			}
		}
		if (!l[1]) {
			puts("NO");
			return 0;
		}
	}
	
	for (int i = 2; i <= m; i ++) {
		l[i] = l[i - 1];
		while (l[i] < n && !check(l[i], b[i], i - 1)) {
			while (l[i] + 1 <= n && a[l[i] + 1] != a[l[i - 1]]) l[i] ++;
			l[i] ++;
		}
		if (l[i] >= n) {
			puts("NO");
			return 0;
		}
		r[i] = max(r[i - 1], l[i]);
		if (a[l[i] + 1] == b[i]) l[i] ++;
		else l[i] = Find(l[i] + 1) + 1;
		while (r[i] + 1 <= n && check(r[i] + 1, a[i], i - 1)) {
			if (r[i] + 1 <= n && a[r[i] + 1] != a[l[i - 1]]) break;
			r[i] ++;
		}
		if (!check(r[i], a[i], i - 1)) {
			puts("NO");
			return 0;
		}
		if (a[r[i] + 1] == b[i]) r[i] = Find(r[i] + 1);
		else r[i] = Find(r[i] + 1) + 1;
	}
	
	for (int i = r[m] + 2; i <= n; i ++)
		if (a[i - 1] != a[i]) {
			puts("NO");
			return 0;
		}
	
	puts("YES");
	for (int i = 1; i <= m; i ++) printf("%d ", r[i]);
	
	return 0;
}