#include <bits/stdc++.h>
using namespace std;
struct Node
{
	long long ac,all,wa,point,per;
	void in()
	{
		cin>>all>>ac;
		wa=all-ac;
		per=100/all;
		point=per*ac;
	}
}t[10];
int main()
{
	long long n,sum=0,au;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		t[i].in();
		sum+=t[i].point;
		//cout<<t[i].point<<' '<<sum<<'\n';
	}
	cin>>au;
	if(sum>=au)
	{
		cout<<"Already Au";
		exit(0);
	}
	sum=au-sum;
	for(int i=1;i<=n;i++)
	{
		if(t[i].wa*t[i].per<sum)
			cout<<"NaN\n";
		else
			cout<<ceil(sum*1.0/t[i].per)<<'\n';
	}
	return 0;
 }