#include <bits/stdc++.h>
using namespace std;
int n, mx, reg;
int p[1005], d[1005];
bool used[1005];
int tused[1005], ind[1005], curtime, tn = 0;
int main() {
  int i, j, k, bi, bd;
  n = ({
    int x;
    scanf("%d", &x);
    x;
  });
  mx = ({
    int x;
    scanf("%d", &x);
    x;
  });
  reg = ({
    int x;
    scanf("%d", &x);
    x;
  });
  for (i = 1; i <= n; i++)
    p[i] = ({
      int x;
      scanf("%d", &x);
      x;
    }),
    d[i] = ({
      int x;
      scanf("%d", &x);
      x;
    });
  int ch = mx, cd = 0;
  curtime = 0;
  for (k = 1; k <= 10000; k++) {
    ch -= cd;
    ch = min(mx, ch + reg);
    if (ch <= 0) break;
    bd = bi = -1;
    for (i = 1; i <= n; i++) {
      if (used[i]) continue;
      if (ch * 100 > p[i] * mx) continue;
      if (d[i] > bd) {
        bd = d[i];
        bi = i;
      }
    }
    if (bi != -1) {
      cd += bd;
      used[bi] = true;
      tused[tn] = curtime;
      ind[tn] = bi;
      tn++;
    } else {
      if (reg - cd >= 0) break;
    }
    curtime++;
  }
  if (ch > 0)
    printf("NO\n");
  else {
    printf("YES\n%d %d\n", curtime, tn);
    for (i = 0; i < tn; i++) printf("%d %d\n", tused[i], ind[i]);
  }
  return 0;
}
