#include <bits/stdc++.h>
using namespace std;
pair<int, int> a[1000];
int b[1000];
int main() {
  int n, hp, rg;
  while (scanf("%d%d%d", &n, &hp, &rg) == 3) {
    for (int i = 0; i < n; i++) {
      scanf("%d%d", &a[i].first, &b[i]);
      a[i].first = -a[i].first;
      a[i].second = i;
    }
    sort(a, a + n);
    int ans = 0, t = 0;
    vector<pair<int, int> > use;
    priority_queue<pair<int, int> > q;
    for (int now = hp;; ans++) {
      now = min(hp, now + rg);
      if (now <= 0) break;
      for (; t < n && now * 100 <= hp * -a[t].first; t++)
        q.push(pair<int, int>(b[a[t].second], -a[t].second));
      if (!q.empty()) {
        rg -= q.top().first;
        use.push_back(pair<int, int>(ans, 1 - q.top().second));
        q.pop();
      }
      if (q.empty() && rg >= 0) break;
    }
    if (rg >= 0) {
      puts("NO");
      continue;
    }
    puts("YES");
    printf("%d %u\n", ans, use.size());
    for (size_t i = 0; i < use.size(); i++)
      printf("%d %d\n", use[i].first, use[i].second);
  }
}
