#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
int dx[]={0,1,0,-1};
int dy[]={1,0,-1,0};
struct edge{int to,cost;};
typedef pair<int,int> P;

bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool isPrime(int x){if(x==1)return 0;if(x==2)return 1;if(x%2==0)return 0;for(int i=3;i*i<=x;i++)if(x%i==0)return 0;return 1;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)&&islower(c));}
void printvi(vector<int> v){rep(i,0,v.size()){if(i)cout<<" ";cout<<v[i];}cout<<endl;}
void printvil(vector<int> v){rep(i,0,v.size()){cout<<v[i]<<endl;}}
void printvvi(vector<vector<int>> v){
    rep(i,0,v.size()){
        rep(j,0,v[i].size()){
            if(j)cout<<" ";
            cout<<v[i][j];
        }
        cout<<endl;
    }
}
void printvstr(vector<string> v){
    rep(i,0,v.size()){
        cout<<v[i]<<endl;
    }
}

int m[]={10,50,100,500};
int culc_money(int a,int b,int c,int d){
    return a*10+b*50+c*100+d*500;
}
vector<int> make_change(int a,int b,int c,int d,int n){
    vector<int> ret(4);
    int change_sum=culc_money(a,b,c,d)-n;
    for(int i=3;i>=0;i--){
        ret[i]=change_sum/m[i];
        change_sum-=m[i]*ret[i];
    }
    return ret;
}

signed main (){
    int n;
    bool start=true;
    while(1){
        
        cin>>n;
        if(n==0)break;
        if(!start)cout<<endl;
        else start=false;
        vector<int> v(4),ans(4);
        rep(i,0,4)cin>>v[i];
        int ans_ct=1e9;
        rep(i,0,v[0]+1){
            rep(j,0,v[1]+1){
                rep(k,0,v[2]+1){
                    rep(p,0,v[3]+1){
                        if(culc_money(i,j,k,p)<n)continue;
                        vector<int> change=make_change(i,j,k,p,n);
                        //渡したお金がまた帰ってきたらアウト
                        if(change[0]&&i)continue;
                        if(change[1]&&j)continue;
                        if(change[2]&&k)continue;
                        if(change[3]&&p)continue;

                        change[0]+=v[0]-i;
                        change[1]+=v[1]-j;
                        change[2]+=v[2]-k;
                        change[3]+=v[3]-p;

                        int ct=accumulate(all(change),0);
                        if(ans_ct>ct){
                            ans_ct=ct;
                            ans[0]=i;
                            ans[1]=j;
                            ans[2]=k;
                            ans[3]=p;
                        }
                    }
                }
            }
        }
        rep(i,0,4){
            if(ans[i]!=0)cout<<m[i]<<" "<<ans[i]<<endl;
        }
    }
    

    
}
/*
*/



Measured memory_bytes: 3012