#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    ll q1, b, c1, c2, q2;
    while(cin >> q1, q1){
        cin >> b >> c1 >> c2 >> q2;
        [&](){
            for (ll i = q2; i >= 1; --i) {
                if(b-c1*i < 0) continue;
                ll j = (b-c1*i)/c2;
                if(q1 <= i+j){
                    cout << i << " " << j << "\n";
                    return;
                }
            }
            puts("NA");
        }();
    }
    return 0;
}
