#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for (int i = 0; i < (int)(n); i++)
typedef long long ll;
typedef pair<int, int> P;
const int INF = 1e9;
const ll MOD = 1000000007;
int main() {
  ll N, K, T;
  cin >> N >> K >> T;
  N = abs(N);
  if ((N + K - 1) / K <= T) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
}