#include<bits/stdc++.h>
using namespace std;

const int N = 1e5 + 10;
int n, m, pos[N][2], la[N][2], l[N], r[N];
int ans[N];
char a[N], b[N];

int main()
{
	scanf("%s%s", a + 1, b + 1);
	n = strlen(a + 1), m = strlen(b + 1);
	a[0] = '0', a[n + 1] = '0', a[n + 2] = '1';
	if(a[n] == '0') pos[n][0] = n + 1, pos[n][1] = n + 2;
	else pos[n][0] = n + 2, pos[n][1] = n + 1;
	for(int i = n - 1; ~i; i--)
		pos[i][0] = a[i] == a[i + 1] ? i + 1 : pos[i + 1][1], pos[i][1] = a[i] == a[i + 1] ? pos[i + 1][1] : i + 1;
	la[1][0] = la[1][1] = 0;
	for(int i = 2; i <= n; i++)
		la[i][0] = a[i] == a[i - 1] ? i - 1 : la[i - 1][1], la[i][1] = a[i] == a[i - 1] ? la[i - 1][1] : i - 1;
	
	for(int i = 1; i <= m; i++)
	{
		if(b[i] == a[l[i - 1]])
			l[i] = pos[l[i - 1]][0], r[i] = a[r[i - 1]] == a[r[i - 1] + 1] ? min(pos[r[i - 1]][1] - 1, n) : pos[r[i - 1]][0] > n ? r[i - 1] : pos[r[i - 1]][0];
		else
			l[i] = pos[l[i - 1]][1], r[i] = pos[r[i - 1]][1] > n ? la[r[i - 1]][1] : a[r[i - 1]] == a[r[i - 1] + 1] ? pos[r[i - 1]][1] : min(pos[r[i - 1]][0] - 1, n);
		if(l[i] > r[i]) return puts("NO"), 0;
	}
	for(int i = r[m] + 1; i < n; i++)
		if(a[i] != a[i + 1]) return puts("NO"), 0;
	
	puts("YES");
	ans[m] = r[m];
	for(int i = m - 1; i; i--)
		ans[i] = min(la[ans[i + 1]][b[i] != b[i + 1]], r[i]);
	for(int i = 1; i <= m; i++)
		printf("%d ", ans[i]);
	return 0;
}