#define _USE_MATH_DEFINES
#include <iostream>
#include <complex>
#include <algorithm>
#include <vector>
#include <stack>
#include <string>
#include <queue>
#include <cmath>
#include <math.h>
#include <numeric>
#include <list>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <climits>
#include <set>
#include <memory.h>
#include <memory>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cassert>
#include <map>
#include <cassert>
#include <time.h>
#include <ctime>

using namespace std;

typedef complex<double> xy_t;
typedef pair<xy_t, xy_t> line;
typedef long long ll;
typedef pair<int, int> P;
typedef pair<int , P> PP;
typedef pair<int, string> Ps;
typedef vector<int> vec;
typedef vector<vec> mat;
const int INF = 1 << 30;
const double EPS = 1e-9;
const double PI = 3.1415926535897932384626433832795;
const int CLK = CLOCKS_PER_SEC;

#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, m, n) for(int i = m; i < n; i++)

int main(){
	int q1, b, c1, c2, q2;
	while(cin >> q1 && q1){
		cin >> b >> c1 >> c2 >> q2;
		int m = min(q2, b / c1);
		//cout << m << endl;
		int res[2] = {0, 0};
		rep2(i, 1, m + 1){
			int p2 = (b - i * c1) / c2;
			//cout << i << " " << p2 << endl;
			if(i + p2 >= q1){
				res[0] = i;
				res[1] = p2;
			}
		}
		if(res[0] == 0) cout << "NA" << endl;
		else cout << res[0] << " " << res[1] << endl;
	}
	return 0;
}