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(q1 == 0) break;
        if(b < c1+(q1-1)*MIN(c2,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 = %lld, qq2 = %lld, b = %lld, q1*c2 = %lld, c1-c2 = %lld\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;
}
*/
int main(){
    ll q1, b, c1, c2, q2, qq1, qq2, b1;
    while(cin >> q1 >> b >> c1 >> c2 >> q2){
        if(q1 == 0) break;
        if(c1 <= c2){
            qq1 = MIN(b/c1, q2), qq2 = 0;
            if(qq1 < q1){ cout << "NA" << endl; continue; }
        } else {
            qq1 = 1, qq2 = q1-1;
            b1 = qq1*c1+qq2*c2;
            if(b1 > b){ cout << "NA" << endl; continue; }
            while(qq1 < q2 && qq2 > 0){
                b1 = (qq1+1)*c1+(qq2-1)*c2;
                if(b1 > b) break;
                qq1++, qq2--;
            }
            while(qq1 < q2){
                b1 = (qq1+1)*c1+qq2*c2;
                if(b1 > b) break;
                qq1++;
            }
            while(1){
                b1 = qq1*c1+(qq2+1)*c2;
                if(b1 > b) break;
                qq2++;
            }
        }
        cout << qq1 << " " << qq2 << 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<1000;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;
}