#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, maxm, reg;
  int p[1000];
  double t[1000];
  vector<int> v;
  int d[1000];
  cin >> n >> m >> reg;
  for (int i = 0; i < n; i++) {
    cin >> p[i] >> d[i];
    t[i] = -1;
  }
  maxm = m;
  int pm = 2 * m;
  int steps = 0, tm = 0;
  int mi = -1, dm = 0;
  int dec = 0;
  do {
    int mi = -1, dm = -1;
    for (int i = 0; i < n; i++)
      if (t[i] < 0 && 100 * m <= p[i] * maxm && d[i] > dm) {
        mi = i;
        dm = d[i];
      }
    if (mi >= 0) {
      t[mi] = tm;
      v.push_back(mi);
      dec += d[mi];
    }
    tm++;
    if (m >= pm) steps++;
    if (steps > 5000) {
      cout << "NO" << endl;
      return 0;
    }
    pm = m;
    m -= dec;
    m += reg;
    if (m > maxm) m = maxm;
  } while (m > 0);
  cout << "YES" << endl;
  cout << tm << " " << v.size() << endl;
  for (int i = 0; i < v.size(); i++) cout << t[v[i]] << " " << v[i] + 1 << endl;
  return 0;
}
