#include <bits/stdc++.h>
using namespace std;
const int iinf = 1e9 + 7;
const long long linf = 1ll << 60;
const double dinf = 1e10;
template <typename T>
inline void scf(T &x) {
  bool f = 0;
  x = 0;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  if (c == '-') {
    f = 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  if (f) x = -x;
  return;
}
template <typename T1, typename T2>
void scf(T1 &x, T2 &y) {
  scf(x);
  return scf(y);
}
template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) {
  scf(x);
  scf(y);
  return scf(z);
}
template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) {
  scf(x);
  scf(y);
  scf(z);
  return scf(w);
}
const int N = 1010;
int n, mx, reg;
priority_queue<pair<pair<int, int>, int> > a, b;
int tot;
vector<pair<int, int> > ans;
int main() {
  scf(n, mx, reg);
  int tot = 0;
  for (int i = (1); i <= (n); i++) {
    int x, y;
    scf(x, y);
    x = mx * x / 100;
    a.push(make_pair(make_pair(x, y), i));
    if (x == mx) tot += y;
  }
  if (tot <= reg) {
    puts("NO");
    return 0;
  }
  puts("YES");
  int D = 0, org = mx;
  for (int i = 0;; i++) {
    while ((int)a.size() && a.top().first.first >= mx) {
      b.push(make_pair(make_pair(a.top().first.second, a.top().first.first),
                       a.top().second));
      a.pop();
    }
    if ((int)b.size()) {
      ans.push_back(make_pair(i, b.top().second));
      D += b.top().first.first;
      b.pop();
    }
    mx -= D;
    mx += reg;
    if (mx > org) mx = org;
    if (mx <= 0) {
      printf("%d ", i + 1);
      break;
    }
  }
  printf("%d\n", (int)ans.size());
  for (auto x : ans) printf("%d %d\n", x.first, x.second);
  return 0;
}
