#include <bits/stdc++.h>
using namespace std;
pair<int, int> P[10001];
int ti = 0, sc, h, n, m, k, tag[10001];
vector<pair<int, int> > ans;
int main() {
  scanf("%d%d%d", &n, &m, &k);
  h = m;
  for (int i = 1, a, b; i <= n; i++) {
    scanf("%d%d", &a, &b);
    P[i] = pair<int, int>(a, b);
  }
  while (h > 0) {
    int sv = -1;
    for (int i = 1; i <= n; i++)
      if (tag[i] == 0 && h <= P[i].first * m / 100 &&
          (sv == -1 || P[i].second > P[sv].second))
        sv = i;
    if (sv != -1)
      ans.push_back(pair<int, int>(ti, sv)), k -= P[sv].second, tag[sv] = 1;
    h += min(k, 0);
    ti++;
    if (sv == -1 && k >= 0) break;
  }
  if (h <= 0) {
    printf("YES\n%d %d\n", ti, ans.size());
    for (int i = 0; i < ans.size(); i++)
      printf("%d %d\n", ans[i].first, ans[i].second);
  } else
    printf("NO");
  return 0;
}
