#include <bits/stdc++.h>
using namespace std;
long long n, maxx, reg, a[1005], b[1005], ans, vis[1005];
vector<pair<long long, long long>> anss;
int main() {
  cin >> n >> maxx >> reg;
  long long tep = maxx;
  for (register long long i = 1; i <= n; i++) cin >> a[i] >> b[i];
  long long check = 0;
  for (register long long i = 1; i <= n; i++) {
    if (a[i] == 100) check += b[i];
  }
  if (check - reg <= 0)
    cout << "NO" << endl;
  else {
    long long hp = 100, kou = 0, cnt = 0;
    while (maxx > 0) {
      long long yong = -1, maxxx = -2147483647;
      for (register long long i = 1; i <= n; i++) {
        if (a[i] >= hp && !vis[i]) {
          if (maxxx < b[i]) yong = i, maxxx = b[i];
        }
      }
      if (maxxx != -2147483647 && yong != -1)
        anss.push_back(make_pair(ans, yong)), cnt++, vis[yong] = 1;
      ans++;
      if (maxxx != -2147483647 && yong != -1) kou += b[yong];
      maxx -= kou - reg;
      maxx = min(maxx, tep);
      hp = 100 - (tep - maxx) * 100 / tep;
      hp = min(1ll * 100, hp);
    }
    cout << "YES" << endl << ans << " " << cnt << endl;
    for (auto it : anss) {
      cout << it.first << " " << it.second << endl;
    }
  }
  return 0;
}
