#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, mx, reg, pow[10000], dmg[10000];
  bool used[10000];
  memset(used, 0, sizeof used);
  cin >> n >> mx >> reg;
  for (register int i = (0); i < (int)n; ++i) cin >> pow[i] >> dmg[i];
  vector<pair<int, int> > log;
  int health = mx, time = -1, fk = 0;
  while (health > 0) {
    time++;
    health = health - fk + reg;
    if (health > mx) health = mx;
    if (health <= 0) break;
    bool change = false;
    int mxdmg = -1, per = 101;
    for (register int i = (0); i < (int)n; ++i)
      if (used[i] == false)
        if (health * 100 <= pow[i] * mx)
          if ((dmg[i] == mxdmg && pow[i] < per) || dmg[i] > mxdmg) {
            mxdmg = dmg[i];
            per = pow[i];
          }
    for (register int i = (0); i < (int)n; ++i)
      if (dmg[i] == mxdmg && per == pow[i] && used[i] == false) {
        log.push_back(make_pair(time, i + 1));
        fk += dmg[i];
        used[i] = true;
        change = true;
        break;
      }
    if (change == false && reg - fk >= 0) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl << time << " " << ((int)(log).size()) << endl;
  for (register int i = (0); i < (int)((int)(log).size()); ++i)
    cout << log[i].first << " " << log[i].second << endl;
  return 0;
}
