#include <bits/stdc++.h>
using namespace std;
const int N = 1010;
int P[N], D[N];
bool used[N];
int main() {
  int n, maxi, reg, sum = 0, life;
  scanf("%d %d %d", &n, &maxi, &reg);
  life = maxi;
  for (int i = 0; i < n; i++) scanf("%d %d", &P[i], &D[i]);
  int t;
  vector<pair<int, int>> vet;
  for (t = 0;; t++) {
    int nl = life;
    nl -= sum;
    nl += reg;
    nl = min(nl, maxi);
    if (nl <= 0) break;
    int chosen = -1;
    for (int i = 0; i < n; i++)
      if (!used[i] and nl * 100 <= maxi * P[i] and
          (chosen == -1 or D[chosen] < D[i]))
        chosen = i;
    if (nl == life and chosen == -1) {
      vet.clear();
      break;
    }
    if (chosen != -1) {
      sum += D[chosen];
      used[chosen] = true;
      vet.push_back({t, chosen + 1});
    }
    life = nl;
  }
  if (vet.empty())
    printf("NO\n");
  else {
    printf("YES\n%d %d\n", t, (int)vet.size());
    for (auto it : vet) printf("%d %d\n", it.first, it.second);
  }
  return 0;
}
