// 基本テンプレート
 
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
using namespace std;
 
#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

const pair<int, int> NIL(-1, -1);
 
signed main() {
    int Q1, B, C1, C2, Q2;
    while(cin >> Q1, Q1) {
        cin >> B >> C1 >> C2 >> Q2;

        pair<int, int> ans = NIL;
        for(int i=Q2; i>=1; i--) {
            if(i * C1 > B) continue;
            int normal = (B - i * C1) / C2;
            if(i + normal < Q1) continue;

            ans = make_pair(i, normal);
            break;
        }

        if(ans != NIL) {
            cout << ans.first << " " << ans.second << endl;
        }
        else {
            cout << "NA" << endl;
        }
    }
    return 0;
}
