#include <bits/stdc++.h>
using namespace std;
int n, m, r, tim, len, dmg, life;
pair<pair<int, int>, int> s[1000];
pair<int, int> st[1000];
bool used[1000];
int main() {
  cin >> n >> m >> r;
  life = m;
  for (int i = 0; i < (n); ++i) {
    cin >> s[i].first.second >> s[i].first.first;
    s[i].second = i + 1;
  }
  sort(s, s + n, greater<pair<pair<int, int>, int> >());
  for (int i = 0; i < (30000); ++i) {
    for (int j = 0; j < (n); ++j)
      if (!used[j] && life * 100 <= s[j].first.second * m) {
        used[j] = true;
        dmg += s[j].first.first;
        st[len++] = make_pair(i, s[j].second);
        if (0) {
          cout << "Adding" << endl;
        };
        if (0) {
          cout << "j"
               << ": " << j << endl;
        };
        if (0) {
          cout << "dmg"
               << ": " << dmg << endl;
        };
        break;
      }
    life -= dmg;
    life += r;
    life = ((m) < (life) ? (m) : (life));
    if (0) {
      cout << "life"
           << ": " << life << endl;
    };
    if (life <= 0) {
      cout << "YES" << endl;
      cout << i + 1 << " " << len << endl;
      for (int j = 0; j < (len); ++j)
        cout << st[j].first << " " << st[j].second << endl;
      return 0;
    }
  }
  cout << "NO";
  return 0;
}
