#include <bits/stdc++.h>
using namespace std;
int main() {
  int N, health, reg;
  cin >> N >> health >> reg;
  int per[1024], def[1025], ava[1025];
  for (int i = 0; i < (N); i++) {
    cin >> per[i] >> def[i];
    ava[i] = 1;
  }
  int sec = 0;
  int H = health;
  vector<pair<int, int> > res;
  int ded = 0;
  while (1) {
    sec++;
    H -= ded;
    H += reg;
    H = min(H, health);
    if (H <= 0) break;
    int suc2 = ded > reg;
    int b1 = -1, b2 = -1;
    for (int i = 0; i < (N); i++) {
      if (H * 100 <= health * per[i]) {
        if ((def[i] > b1) && ava[i]) {
          b1 = def[i];
          b2 = i;
        }
      }
    }
    if ((b2 == -1) && !suc2) {
      puts("NO");
      return 0;
    }
    if (b2 != -1) {
      ava[b2] = 0;
      ded += def[b2];
      res.push_back(make_pair(sec, b2));
    }
  }
  puts("YES");
  printf("%d %d\n", sec - 1, res.size());
  for (int i = 0; i < (res.size()); i++)
    printf("%d %d\n", res[i].first - 1, res[i].second + 1);
  return 0;
}
