#ifdef LOCAL
    #define _GLIBCXX_DEBUG
    #define __clock__
#else
    #pragma GCC optimize("Ofast")
#endif
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<ll>;
using VV = vector<VI>;
using VS = vector<string>;
using PII = pair<ll, ll>;

// tourist set
template <typename A, typename B>
string to_string(pair<A, B> p);

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p);

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p);

string to_string(const string& s) {
  return '"' + s + '"';
}

string to_string(const char* s) {
  return to_string((string) s);
}

string to_string(bool b) {
  return (b ? "true" : "false");
}

string to_string(vector<bool> v) {
  bool first = true;
  string res = "{";
  for (int i = 0; i < static_cast<int>(v.size()); i++) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(v[i]);
  }
  res += "}";
  return res;
}

template <size_t N>
string to_string(bitset<N> v) {
  string res = "";
  for (size_t i = 0; i < N; i++) {
    res += static_cast<char>('0' + v[i]);
  }
  return res;
}

template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto &x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}

template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}

template <typename A, typename B, typename C>
string to_string(tuple<A, B, C> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";
}

template <typename A, typename B, typename C, typename D>
string to_string(tuple<A, B, C, D> p) {
  return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ", " + to_string(get<3>(p)) + ")";
}

void debug_out() { cerr << '\n'; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif
// tourist set end

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define rep(i,b) FOR(i, 0, b)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<'\n'
#define p2(s, t) cout << (s) << " " << (t) << '\n'
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << '\n'
#define p_yes() p("YES")
#define p_no() p("NO")
#define SZ(x) ((int)(x).size())
#define SORT(A) sort(ALL(A))
#define RSORT(A) sort(ALL(A), greater<ll>())
#define MP make_pair

ll SUM(VI& V){
  return accumulate(ALL(V), 0LL);
}

void print_vector(VI& V){
  ll n = V.size();
  rep(i, n){
    if(i) cout << ' ';
    cout << V[i];
  }
  cout << endl;
}

ll gcd(ll a,ll b){
    if(b == 0) return a;
    return gcd(b,a%b);
}

ll lcm(ll a,ll b){
    ll g = gcd(a,b);
    return a / g * b;
}

void no(){p_no(); exit(0);}
void yes(){p_yes(); exit(0);}

const ll mod = 1e9 + 7;
const ll inf = 1e18;
const double PI = acos(-1);

// (10, 50, 100, 500);
VI f(ll a){
  VI V;
  V.push_back(a/500);a%=500;
  V.push_back(a/100);a%=100;
  V.push_back(a/50);a%=50;
  V.push_back(a/10);a%=10;
  reverse(ALL(V));
  return V;
}

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

    // input
    ll pay;
    bool first=true;
    while(cin>>pay){
      if(pay==0) return 0;
      if(first){
        first=false;
      }else{
        cout << endl;
      }

      VI A(4);
      rep(i,4)cin>>A[i];
      ll sum = SUM(A);
      // debug(sum);

      ll mi = inf;
      VI purse(4);

      rep(i,A[0]+1){
        rep(j,A[1]+1){
          rep(k,A[2]+1){
            rep(l,A[3]+1){
              ll total = 10*i + 50*j + 100*k + 500*l;
              if(total<pay) continue;
              VI C = {i,j,k,l}; // 払ったコイン
              ll otsuri = total - pay;
              VI D = f(otsuri); // 戻ってくるコイン
              bool ok=true;
              rep(m,4){
                if(C[m]>0 && D[m]>0) ok=false;
              }
              if(ok){
                // 最終的に財布にある枚数
                ll mai = sum-i-j-k-l + SUM(D);
                if(mai<mi){
                  // debug(i,j,k,l);
                  // debug(D);
                  // debug(mai);
                  // debug(sum, i, j, k, l, SUM(D));
                  mi = mai;
                  //purse = {A[0]-i+D[0], A[1]-j+D[1], A[2]-k+D[2], A[3]-l+D[3]};
                  purse = {i,j,k,l}; // 払ったコイン情報
                  // debug(purse);
                }
              }
            }
          }
        }
      }

      // 全コインを提出する
      // ll all = 10*A[0] + 50*A[1] + 100*A[2] + 500*A[3];
      // ll rest = all - pay;
      // VI D = f(rest);
      // rep(i, 4){
      //   if(A[i]-D[i]>0){
      //     purse[i] = A[i]-D[i];
      //   }
      // }

      // 答え
      // if(purse[0]>0) p2(10, purse[0]);
      // if(purse[1]>0) p2(50, purse[1]);
      // if(purse[2]>0) p2(100, purse[2]);
      // if(purse[3]>0) p2(500, purse[3]);

      vector<PII> Ans;
      if(purse[0]>0) Ans.push_back(MP(10, purse[0]));
      if(purse[1]>0) Ans.push_back(MP(50, purse[1]));
      if(purse[2]>0) Ans.push_back(MP(100, purse[2]));
      if(purse[3]>0) Ans.push_back(MP(500, purse[3]));
      ll L=Ans.size();
      rep(i,L){
        cout << Ans[i].first << ' ' << Ans[i].second << endl;
        // if(i!=L-1) cout << endl;
      }
    }
    
    return 0;
}


Measured memory_bytes: 3060