awa
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
constexpr int N = 1010;
int n, q[N], a[N], s[N];
int tot, gain;
int main(){
cin >> n;
for (int i = 1; i <= n; i ++){
cin >> q[i] >> a[i];
s[i] = 100 / q[i];
}
cin >> tot;
for (int i = 1; i <= n; i ++){
gain += s[i] * a[i];
}
if (gain >= tot){
puts("Already Au.");
return 0;
}
int delta = tot - gain;
for (int i = 1; i <= n; i ++){
if (q[i] == a[i] || (q[i] - a[i]) * s[i] < delta){
puts("NaN");
continue;
}
if (delta / s[i] != 0) cout << delta / s[i] + 1 << endl;
else cout << delta / s[i] << endl;
}
return 0;
}