#include<bits/stdc++.h>
using namespace std;
int n,fsx,cnt;
int a[10000],b[10000]; 
long long sum,t,f; 
int main(){
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i]>>b[i];
	}
	while(cnt<n){
		t=100/a[++cnt];
		f=t*b[cnt];
		sum+=f;
	}
	cin>>fsx;
	if(sum>=fsx){
		cout<<"Already Au."<<endl;
	}else{
		for(int i=1;i<=n;i++){
			if(a[i]==b[i]){
				cout<<"NaN"<<endl;
			}else{
				cout<<ceil((fsx-sum)/(100.0/a[i]))<<endl;
			}
		}
	}
	return 0;
}