//OHHHH ME VEEEEEEENGO!!!!
#include<bits/stdc++.h>
#define FAST_IO ios::sync_with_stdio(0); cin.tie(nullptr)
#define rall(x) (x).rbegin(), (x).rend()
#define all(x) (x).begin(), (x).end()
#define ii pair<int, int>
#define pb push_back
#define ss second
#define ff first
using namespace std;
typedef long long ll;
typedef long double Double;
const int INF=1e9;
const int N=1e4+7;
const int MOD=998244353;

void solve(){
  int a, b, k; cin>>a>>b>>k;
  if(b==1){
    if(k==0){
      cout<<"Yes"<<endl;
      cout<<1;
      for(int i=0; i<a; ++i) cout<<0;
      cout<<endl;
      cout<<1;
      for(int i=0; i<a; ++i) cout<<0;
      cout<<endl;
      return;
    }
    cout<<"No"<<endl;
    return;
  }
  if(k>=a+b-1){
    cout<<"No"<<endl;
    return;
  }
  if(a==0){
    if(k==0){
      cout<<"Yes"<<endl;
      for(int i=0; i<b; ++i) cout<<1;
      cout<<endl;
      for(int i=0; i<b; ++i) cout<<1;
      cout<<endl;
      return;
    }
    cout<<"No"<<endl;
    return;
  }
  cout<<"Yes"<<endl;
  if(k==0){
    cout<<1;
    for(int i=0; i<a; ++i) cout<<0;
    for(int i=0; i<b-1; ++i) cout<<1;
    cout<<endl;
    cout<<1;
    for(int i=0; i<a; ++i) cout<<0;
    for(int i=0; i<b-1; ++i) cout<<1;
    cout<<endl;
    return;
  }
  cout<<1;
  int ceros=a;
  for(int i=0; i<a+b-1; ++i){
    if(i==a+b-2-k){
      cout<<1;
      continue;
    }
    if(i==a+b-2){
      cout<<0;
      continue;
    }
    if(ceros>1){
      cout<<0;
      ceros--;
      continue;
    }
    if(ceros==1){
      cout<<1;
      continue;
    }
  }
  cout<<endl;
  cout<<1;
  ceros=a;
  for(int i=0; i<a+b-1; ++i){
    if(i==a+b-2-k){
      cout<<0;
      continue;
    }
    if(i==a+b-2){
      cout<<1;
      continue;
    }
    if(ceros>1){
      cout<<0;
      ceros--;
      continue;
    }
    if(ceros==1){
      cout<<1;
      continue;
    }
  }
  cout<<endl;
  return;
}

int main(){
  FAST_IO;
  solve();
}