#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, mx, reg;
  cin >> n >> mx >> reg;
  vector<pair<int, int> > scrolls;
  int damage = 0;
  int health = mx;
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    scrolls.push_back(pair<int, int>(b, a));
  }
  int sec = 0;
  vector<int> used;
  vector<int> available(n, 1);
  while (true) {
    health -= damage;
    health = min(mx, health + reg);
    if (health <= 0) {
      break;
    }
    int scrdam = -1;
    int scrind = -1;
    for (vector<pair<int, int> >::iterator iter = scrolls.begin();
         iter != scrolls.end(); ++iter) {
      if (available[iter - scrolls.begin()] &&
          health * 100 <= iter->second * mx) {
        if (iter->first > scrdam) {
          scrdam = iter->first;
          scrind = iter - scrolls.begin();
        }
      }
    }
    if (scrind != -1) {
      used.push_back(scrind + 1);
      damage += scrdam;
      available[scrind] = 0;
    } else {
      used.push_back(0);
    }
    ++sec;
    if (sec == 10000) {
      cout << "NO" << endl;
      return 0;
    }
  }
  cout << "YES" << endl;
  cout << sec << ' '
       << n - accumulate((available).begin(), (available).end(), 0) << endl;
  for (int i = 0; i < sec; ++i) {
    if (used[i]) {
      cout << i << ' ' << used[i] << endl;
    }
  }
  return 0;
}
