#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[1010];
vector<pair<int, int> > ans;
bool used[1010];
int main() {
  int N, HP, K, dam = 0;
  cin >> N >> HP >> K;
  for (int i = 0; i < N; i++) cin >> a[i].first >> a[i].second;
  int hp = HP;
  int t = 0;
  int cnt = 0;
  while (hp > 0) {
    hp -= dam;
    hp += K;
    bool did = 0;
    int maxdam = -1;
    int pos;
    hp = min(hp, HP);
    for (int i = 0; i < N; i++) {
      if (used[i]) continue;
      if (hp * 100 > a[i].first * HP) continue;
      if (a[i].second > maxdam) {
        maxdam = a[i].second;
        pos = i + 1;
        did = 1;
      }
    }
    if (!did) {
      if (dam <= K) {
        puts("NO");
        return 0;
      }
    } else {
      dam += a[pos - 1].second;
      used[pos - 1] = 1;
      ans.push_back({pos, t});
    }
    t++;
  }
  if (ans.back().second == t - 1) ans.erase(ans.end() - 1);
  puts("YES");
  cout << t - 1 << ' ' << ans.size() << endl;
  for (int i = 0; i < ans.size(); i++)
    cout << ans[i].second << ' ' << ans[i].first << endl;
  return 0;
}
