Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
	"strings"
)

var scanner = bufio.NewScanner(os.Stdin)

func main() {
	for scanner.Scan() {
		buf := strings.Split(scanner.Text(), " ")
		if buf[0] == "0" {
			break
		}
		q1, _ := strconv.Atoi(buf[0]) // 買うべき鶏肉の量の下限(g)
		b, _ := strconv.Atoi(buf[1])  // 予算
		c1, _ := strconv.Atoi(buf[2]) // 会津地鶏の値段(/100g)
		c2, _ := strconv.Atoi(buf[3]) // 普通の鶏肉の値段(/100g)
		q2, _ := strconv.Atoi(buf[4]) // 会津地鶏の買える量の上限(g)
		maxAizuChiken := min(b/c1, q2)
		if maxAizuChiken <= 0 {
			fmt.Println("NA")
			continue
		}
		if c2 >= c1 {
			maxNormalChiken := (b - maxAizuChiken*c1) / c2
			if maxAizuChiken+maxNormalChiken < q1 { // 買い切ったけども必要な鶏肉の下限に達しなかった
				fmt.Println("NA")
			} else {
				fmt.Println(maxAizuChiken, maxNormalChiken)
			}
			continue
		}
		if (b-c1)/c2+1 < q1 { // 会津地鶏を1単位+普通の鶏肉を予算目一杯買ったが買うべき下限を超えなかった
			fmt.Println("NA")
			continue
		}
		// 二分探索
		low, high := 0, maxAizuChiken+1
		for high-low > 1 {
			mid := (low + high) / 2
			if check(mid, b, c1, c2, q1) {
				low = mid
			} else {
				high = mid
			}
		}
		fmt.Println(low, (b-low*c1)/c2)
	}
}

func check(mid, b, c1, c2, q1 int) bool {
	if mid+(b-mid*c1)/c2 < q1 {
		return false
	}
	return true
}

func min(a, b int) int {
	if a > b {
		return b
	}
	return a
}

C++: 
#define _CRT_SECURE_NO_WARNINGS
#define _USE_MATH_DEFINES
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <iostream>
#include <memory>
#include <string>

#include <algorithm>
#include <complex>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <vector>
#include <bitset>

using namespace std;

#ifdef _MSC_VER
#define __typeof__ decltype
#define strtok_r strtok_s
#endif

#define ITER(c)             __typeof__((c).begin())
#define FOREACH(it, c)      for (ITER(c) it=(c).begin(); it != (c).end(); ++it)
#define RITER(c)            __typeof__((c).rbegin())
#define RFOREACH(it, c)     for (RITER(c) it=(c).rbegin(); it != (c).rend(); ++it)
#define REP(i, n)           REPEAT(i, 0, n)
#define RREP(i, n)          RREPEAT(i, 0, n)
#define REPEAT(i, k, n)     for(int i = (k); i < ((k)+(n)); ++i)
#define RREPEAT(i, k, n)    for(int i = (k)+(n)-1; i >= (k); --i)
#define FROMTO(i,f,t)       for(int i = f; i < t; i++)
#define ALL(c)              (c).begin(), (c).end()
#define LLPOW(p1,p2)        ((ll)pow((double)(p1), (int)p2))
#define ESIZEOF(A)          (sizeof(A)/sizeof((A)[0]))
#define CIN_NO_SYNC         do { cin.tie(0); ios_base::sync_with_stdio(false); } while(0)
#define GETSTR(p)           fgets((p), sizeof(p), stdin)
#define CHOMP(p)            do{ char *_q = (p) + strlen(p)-1; if(*_q == '\n' || *_q == '\r') *_q = 0; } while(0)
#define FILL(m,v)           memset(m, v, sizeof(m))
#define mp                  make_pair
#define pb                  push_back
template<class _T> _T MAX(_T p1,_T p2){return (p1>p2)?p1:p2;} 
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
template <class _Tv> inline string join(const _Tv &v,string sep=" "){
    ostringstream s;FOREACH(it,v){if(it!=v.begin())s<<sep;s<<*it;};return s.str();
}

typedef long long ll;
typedef unsigned long long ull;
typedef double D;
typedef complex<D> P;
typedef vector<int> VI;
typedef vector<VI> VVI;
#define X real()
#define Y imag()
#define EPS (1e-9)
#define DEQ(p1,p2) (abs((p1)-(p2)) < EPS)

#ifdef _DEBUG
template<class _Tv> inline void _prfe(const char *_n,const _Tv _c,bool _p=false){
    ITER(_c) _it=_c.begin();
    if(_p){cout<<_n<<" = ["<<endl;for(;_it!=_c.end();++_it)cout<<"    "<<*_it<<endl;cout<<"]"<<endl; }
    else{cout<<_n<<" = [ ";if(_c.size()){cout<<*_it++;for(;_it!=_c.end();++_it)cout<<", "<<*_it;}cout<<" ]"<<endl; }
}
ostream &operator<<(ostream &os, const pair<int,int> &p){return(os<<"("<<p.first<<","<<p.second<<")");}
#define pf printf
#define pr(n) do{cout<<#n" = "<<(n)<<endl;}while(0)
#define prfe(n) _prfe(#n, n)
#define prfep(n) _prfe(#n, n, true)
#define dbgchk(n) do{if(n)throw;}while(0)
#else
#define pf(...) /* */
#define pr(...) /* */
#define prfe(...) /* */
#define prfep(...) /* */
#define dbgchk(...) /* */
#endif

int main(){
    ll q1, b, c1, c2, q2, qq1, qq2, b1;
    while(cin >> q1 >> b >> c1 >> c2 >> q2){
        if(b < c1+(q1-1)*c2 && b < q1*c1){ cout << "NA" << endl; continue; }
        qq1 = MIN(q2, q1);
        if(c1 > c2) qq1 = MIN(qq1, (b-q1*c2)/(c1-c2));
        qq2 = q1 - qq1;
        pf("qq1 = %d, qq2 = %d, b = %d, q1*c2 = %d, c1-c2 = %d\n", qq1, qq2, b, q1*c2, c1-c2);
        b1 = b - (qq1*c1+qq2*c2); qq1 = MIN(q2, qq1 + b1/c1);
        b1 = b - (qq1*c1+qq2*c2); qq2 = qq2 + b1/c2;
        cout << qq1 << " " << qq2 << endl;
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

typedef long long ll;
int main(){
	ll b,c1,c2,q1,q2,aizu,ord;
	bool flag;

	while(cin>>q1,q1){
		flag=false;
		cin>>b>>c1>>c2>>q2;
		if(b/c1>q2){
			aizu=q2;
			ord=(b-c1*q2)/c2;
		}else{
			aizu=b/c1;
			ord=(b%c1)/c2;
		}
		//cout<<aizu<<" "<<ord<<endl;
		if(aizu==0){cout<<"NA"<<endl;}
		else if((aizu+ord)<q1){
			for(ll i=aizu-1;i>0;i--){
				if((b-c1*i)/c2>=q1-i){
					flag=true;
					cout<<i<<" "<<(b-c1*i)/c2<<endl;
					break;
				}
			}
			if(!flag){
				cout<<"NA"<<endl;
			}
		}else{
			cout<<aizu<<" "<<ord<<endl;
		}
	}
	return 0;
}

C++: #include <algorithm>
#include <cctype>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <functional>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <vector>

using namespace std;

#define reps(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reps(i,0,n)

typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> pii;

int main()
{
	ll q1, b, c1, c2, q2;
	while(scanf("%lld", &q1), q1){
		scanf("%lld%lld%lld%lld", &b, &c1, &c2, &q2);
		b -= c1;
		q1--; q2--;
		
		int ans[2] = {0};
		rep(i, q1+1){
			ll cost = i*c1 + (q1-i)*c2;
			if(cost <= b){
				ans[0] = i + (b-cost)/c1;
				ans[1] = q1-i + ((b-cost)%c1)/c2;
			}
		}
		
		if(ans[0] > q2){
			ans[0] = q2;
			ans[1] = (b-q2*c1)/c2;
		}
		
		if(ans[0]+ans[1] >= q1)
			printf("%d %d\n", ans[0]+1, ans[1]);
		else
			puts("NA");
	}
	return 0;
}

C++: #include<iostream>
#include<math.h>
#include<vector>
#include<algorithm>
#include<cstdio>
#include <string>
#include <complex>
#include <functional>
using namespace std;
typedef pair<int,int> P;
int cnt[7];
int main(){
    long les,m,a,c,w;
    while(cin>>les,les){
        cin>>m>>a>>c>>w;
        int ch=0;
        long cc=0;
        int i=0;
        long k=m/a;
        if(m/c<les||k==0){
            cout<<"NA 2"<<endl;
            continue;
        }
        if(k>w)k=w;
        for(i=k;i>0;i--){
            cc=(m-i*a)/c;
            if(cc+i>=les) {
                ch=1;
                break;
            }
        }
        if(ch) cout<<i<<" "<<cc<<endl;
        else cout<<"NA"<<endl;
    }
    return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

using namespace std;

int main()
{
	int q1,b,c1,c2,q2;
	while(cin >> q1 && q1)
	{
		cin >> b >> c1 >> c2 >> q2;
		

		if(c1 + c2 * (q1 - 1) > b) cout << "NA" << endl;
		else
		{
			int cnt = 1,cnt_2 = q1 - 1,res = c1 + c2 * (q1 - 1);
			bool flag = false;

			while(res < b)
			{
				if(cnt_2 < 0) 
				{
					flag = true;
					break;
				}

				if(cnt <= q2)
				{
					res += c1 - c2;
					cnt++;
					cnt_2--;
				}
				else break;
			}

			cnt--;
			cnt_2++;
			res -= c1 - c2;
			
			if(cnt == q2)
			{
				cnt_2 += (b-res)/c2;
			}

			if(flag)
			{
				while(cnt <= q2 && res <= b)
				{
					cnt++;
					res += c1;
				}
				cnt--;
				res -= c1;

				if(cnt == q2)
				{
					cnt_2 += (b-res)/c2;
				}
			}

			cout << cnt << " " << cnt_2 << endl;
		}

	}
	return 0;
}