#include <bits/stdc++.h>
using namespace std;
int dx[4] = {1, 0, -1, 0};
int dy[4] = {0, 1, 0, -1};
class UnionFind {
 public:
  vector<int> par, rank, node;
  UnionFind(int n) : par(n), rank(n, 0), node(n, 1) {
    for (int i = 0; i < n; i++) par[i] = i;
  }
  void init(int n) {
    for (int i = 0; i < n; i++) {
      par[i] = i;
      rank[i] = 0;
      node[i] = 1;
    }
  }
  int find(int x) { return par[x] == x ? x : par[x] = find(par[x]); }
  bool same(int x, int y) { return find(x) == find(y); }
  void unite_tree(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    if (rank[x] < rank[y]) {
      par[x] = y;
    } else {
      par[y] = x;
      if (rank[x] == rank[y]) rank[x]++;
    }
  }
  int size(int x) { return node[find(x)]; }
  void unite_node(int x, int y) {
    x = find(x);
    y = find(y);
    if (x == y) return;
    if (size(x) < size(y)) swap(x, y);
    node[x] += node[y];
    par[y] = par[x];
  }
};
long long ans[100010];
int main(void) {
  int a, b, c;
  cin >> a >> b >> c;
  if (a + 2 * b >= c)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
