// practice with Dukkha
#include <algorithm>
#include <iostream>

using namespace std;

const int N = 200000;

char xx[N + 1], yy[N + 1];

int main() {
	int a, b, k; cin >> a >> b >> k;
	int n = a + b;
	if ((a == 0 || b == 1 || k > n - 2) && k > 0) {
		cout << "No\n";
		return 0;
	}
	fill(xx, xx + n, '0');
	fill(yy, yy + n, '0');
	xx[0] = yy[0] = '1', b--;
	if (b) {
		int j = n - 1, i = j - k;
		xx[i] = yy[j] = '1', b--;
		for (int h = 1; h < n && b; h++)
			if (h != i && h != j)
				xx[h] = yy[h] = '1', b--;
	}
	xx[n] = yy[n] = 0;
	cout << "Yes\n" << xx << '\n' << yy << '\n';
	return 0;
}
