#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll a, b, k;
    cin >> a >> b >> k;
    if(b == 1) {
        if(k == 0) {
            cout << "Yes\n";
            cout << 1;
            rep(i, 0, a) cout << 0;
            cout << "\n";
            cout << 1;
            rep(i, 0, a) cout << 0;
            cout << "\n";
            return;
        } else {
            cout << "No\n";
            return;
        }
        return;
    }       
    if(a == 0) {
        if(k == 0) {
            cout << "Yes\n";
            rep(i, 0, b) cout << 1;
            cout << "\n";
            rep(i, 0, b) cout << 1;
            cout << "\n";
            return;
        } else {
            cout << "No\n";
            return;
        }
        return;
    } 
    if(k == 0) {
        cout << "Yes\n";
        rep(i, 0, b) cout << 1;
        rep(i, 0, a) cout << 0;
        cout << "\n";
        rep(i, 0, b) cout << 1;
        rep(i, 0, a) cout << 0;
        cout << "\n";
        return;
    }
    if(k > a + b - 2) {
        cout << "No\n";
        return;
    }
    ll n = a+b;
    vector<ll> s(n, -1), t(n, -1);
    s[0] = 1; t[0] = 1;
    s[n-1] = 0; t[n-1] = 1;
    s[n-1-k] = 1; t[n-1-k] = 0;
    b -= 2; a--;
    rep(i, 0, n) {
        if(s[i] != -1) continue; 
        if(a > 0) {
            s[i] = 0;
            t[i] = 0;
            a--;
        } else {
            s[i] = 1;
            t[i] = 1;
        }
    }
    cout << "Yes\n";
    rep(i, 0, n) cout << s[i];
    cout << "\n";
    rep(i, 0, n) cout << t[i];
    cout << "\n";
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}
