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++: #include<iostream>
using namespace std;
int main(){
  int q1,b,c1,c2,q2;
  cin >> q1;
  while(q1!=0){
    cin >> b >> c1 >> c2 >> q2;
    int x1=0,x2=0,m=min(c1,c2);
    bool f=false;
    //cout << b-min(c1,c2)*q1 << endl;
    if(b<m*q1) f=true;
    
    if(c1<=c2){
      while(b>=c1*(x1+1)&&x1<q2) x1++;
      while(b>=c1*x1+c2*(x2+1)) x2++;
      if(x1==0) f=true;
      if(f) cout << "NA" << endl;
      else cout << x1 << " " << x2 << endl;
      cin >> q1;
    }else{
    int s=c1-c2,sum=0;
    sum=q1*m;
    while(b-sum>=s*(x1+1)&&x1<q2&&b>=c1*(x1+1)) {
      x1++; 
      //cout << b-sum<<":"<<s*x1<<endl;
      //cout << x1<<":"<<c1*x1<<endl;
    }
    //while(b>=c1*(x1+1)&&x1<q2) x1++;
    //while(b>=c1*x1+c2*(x2+1)) x2++;
    
    if(x1==0) f=true;
    x2=0;
    while(b>=c1*x1+c2*(x2+1)) x2++;
    if(f) cout << "NA" << endl;
    else cout << x1 << " " << x2 << endl;
    cin >> q1;
    }
  }
  return 0;
}

C++: // 2011/08/22 Tazoe

#include <iostream>
using namespace std;

int main()
{
	while(true){
		int q1;
		cin >> q1;
		if(q1==0)
			break;

		int b, c1, c2, q2;
		cin >> b >> c1 >> c2 >> q2;

		int A = 1;
		int B = (b-c1*A)/c2;
		if(b-c1*A<0||A+B<q1){
			cout << "NA" << endl;
			continue;
		}

		while(b-c1*A>=0&&A+B>=q1&&A<=q2){
			A++;
			B = (b-c1*A)/c2;
		}
		A--;
		B = (b-c1*A)/c2;

		cout << A << ' ' << B << endl;
	}

	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(0);

    while(true) {
        int Q1, B, C1, C2, Q2;
        cin >> Q1 >> B >> C1 >> C2 >> Q2;
        if(!Q1) break;

        bool found = false;
        for(int q2 = Q2; q2 >= 1; --q2) {
            const int cost1 = C1*q2;
            const int rem = B - cost1;
            if(rem < 0) continue;
            const int amount = rem / C2;
            //cout << q2 << ' ' << rem << ' ' << amount << endl;
            if(q2 + amount >= Q1) {
                cout << q2 << ' ' << amount << endl;
                found = true;
                break;
            }
        }
        if(!found) {
            cout << "NA" << 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);
		ll ans[2] = {0ll};
		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] >= 1 && ans[0]+ans[1] >= q1)
			printf("%lld %lld\n", ans[0], ans[1]);
		else
			puts("NA");
	}
	return 0;
}

C++: // 2014/06/05 Tazoe

#include <iostream>
using namespace std;

int main()
{
	while(true){
		int q1;
		cin >> q1;

		if(q1==0)
			break;

		int b, c1, c2, q2;
		cin >> b >> c1 >> c2 >> q2;

		if((q1-1)*c2>b-c1){
			cout << "NA" << endl;
			continue;
		}

		int Q1, Q2;

		Q1 = b/c1;
		if(Q1>q2){
			Q1 = q2;
		}

		Q2 = (b-c1*Q1)/c2;

		while(Q1+Q2<q1){
			Q1--;
			Q2 = (b-c1*Q1)/c2;
		}

		cout << Q1 << ' ' << Q2 << endl;
	}

	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <bitset>
#include <stack>
#include <utility>
#include <numeric>
#include <algorithm>
#include <functional>
#include <complex>
#include <string>
#include <sstream>

#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>

using namespace std;

#define all(c) c.begin(),c.end()
#define rep(i,n) for(int i=0;i<(int)n;i++)
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << endl

typedef long long ll;
typedef vector<int> vi;

template<typename T>
ostream& operator<<(ostream& os,const vector<T>& val){
    os << "[ ";
    for(typename vector<T>::const_iterator it=val.begin();
        it != val.end();++it){
        os << *it << " ";
    }
    os << "]";
    return os;
}
// 買うべき鶏肉の量の下限 q1、予算 b、このお肉屋さんでの会津地鶏100グラムの値段 c1、ふつう の鶏肉100グラムの値段 c2、
// 会津地鶏を一人が買える量の上限 q2 を入力とし、一郎君が買う会津地 鶏とふつうの鶏肉の量を100グラム単位で出力するプログラムを作成してください。
// ただし、このお 肉屋さんではお母さんの指示通りに買えない場合には、「NA」と出力してください。
string solve(ll q1,ll b,ll c1,ll c2,ll q2){
    ll low = 1;
    ll high = q2;
    for(int k=0;k<100;k++){
       // for(int k=0;k<3;k++){
        ll mid = (low + high) / 2;
         // debug(low);
         // debug(mid);
         // debug(high);
        ll rest = q1 - mid;
        ll need = mid * c1;
        if(rest > 0){
            need += rest * c2;
        }
        if(need <= b){
            low = mid;
        }else{
            high = mid;
        }
    }
    if(low == 1){
        ll rest = q1 - low;
        ll need = low * c1;
        if(rest > 0){
            need += rest * c2;
        }
        if(need > b){
            return "NA";
        }
    }
    if(low < high){
        low++;
        ll rest = q1 - low;
        ll need = low * c1;
        if(rest > 0){
            need += rest * c2;
        }
        if(need > b){
            low--;
        }
    }
    stringstream ss;
    ss << low << " " << (b - low*c1) / c2;
    return ss.str();
}
int main(){
    while(true){
        ll q1,b,c1,c2,q2;
        cin >> q1;
        if(q1 == 0) break;
        cin >> b >> c1 >> c2 >> q2;
        cout << solve(q1,b,c1,c2,q2) << endl;
    }
    return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	int q1,b,c1,c2,q2;
	while(cin >> q1 , q1){
		cin >> b >> c1 >> c2 >> q2;
		int one = min(q2,b/c1) , two = 0;
		int cur = b - c1 * one;
		while(one+two<q1 && one > 0){
			if(cur<c2) one-- , cur += c1;
			while(cur - c2 >= 0){
				two++;
				cur -= c2;
			}	
		}
		if(one == 0 || cur < 0 || one+two < q1){
			cout << "NA" << endl;
		}else{
			cout << one << " " << two << endl;
		}
		
	}
}

C++: #include <iostream>
using namespace std;
typedef long long ll;
template<class _T> _T MIN(_T p1,_T p2){return (p1<p2)?p1:p2;} 
int main(){
    ll q1, b, c1, c2, q2;
    while(cin >> q1 >> b >> c1 >> c2 >> q2){
        q2 = MIN(q2, b/c1);
        while(q2 > 0 && q2+(b-q2*c1)/c2 < q1) q2--;
        if(q2 == 0){
            cout << "NA" << endl;
        } else {
            cout << q2 << " " << (b-q2*c1)/c2 << endl;
        }
    }
    return 0;
}