#include<bits/stdc++.h>
using namespace std;
const int qwq = 1e6 + 10;
struct node {
	int s,fen,ping;
} a[qwq];
int n;
int cnt;
int main() {
	cin>>n;
	for(int i = 1; i <= n; i++) {
		cin>>a[i].s>>a[i].fen;
		a[i].ping = 100/a[i].s;
		cnt += a[i].fen*a[i].ping;
	}
	int m;
	cin>>m;
	if(cnt >= m) {
		cout<<"Already Au."<<endl;
		exit(0);
	}
	cnt = m - cnt;
	for(int i = 1; i <= n; i++) {
		if(a[i].fen == a[i].s) {
			cout<<"NaN"<<endl;
		} else {
			int p = (a[i].s-a[i].fen)*a[i].ping;
			if(p < cnt) {
				cout<<"NaN"<<endl;
			} else {
				if(cnt <= a[i].ping)
					cout<<"1"<<endl;
				else
					cout<<ceil(cnt / a[i].ping)+1<<endl;
			}
		}
	}
	return 0;
}