#include <bits/stdc++.h>
using namespace std;
using pii = pair<int, int>;
const int N = 1000;
int n, m, r, p[N], d[N];
bool used[N];
vector<pii> ans;
int solve() {
  int m0 = m, t = 0, dd = 0;
  while (m > 0) {
    int m2 = min(m0, m - dd + r), j = -1;
    for (int i = 0; i < n; i++) {
      if (!used[i] && (m2 * 100 + m0 - 1) / m0 <= p[i]) {
        if (j == -1 || d[j] < d[i]) j = i;
      }
    }
    if (m2 >= m && j == -1) return -1;
    if (j >= 0 && m2 >= 0) ans.emplace_back(t, j), dd += d[j], used[j] = true;
    m = m2, t++;
    ;
  }
  return t - 1;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout << fixed;
  cin >> n >> m >> r;
  for (int i = 0; i < n; i++) cin >> p[i] >> d[i];
  int t = solve();
  cout << (t == -1 ? "NO" : "YES") << endl;
  if (t >= 0) {
    cout << t << ' ' << ans.size() << endl;
    for (pii ti : ans) cout << ti.first << ' ' << (ti.second + 1) << endl;
  }
  return 0;
}
