#include <bits/stdc++.h>
using namespace std;
#define rep(i, l, r) for (ll i = (l); i < (r); ++i)
#define all(x) (x).begin(), (x).end()
using ll = long long;
using pl = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using vi = vector<int>;
using vvi = vector<vector<int>>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

int main(){
    ll s,t,n;
    cin>>s>>t>>n;
    vl p(3);
    vl a(3);
    vl b(3);
    rep(i,0,3){
        cin>>p[i]>>a[i]>>b[i];
    }

    vector<ll> u(1001,0);
    ll re=1000000000000000000;
    rep(i,t,1001){
        u[i]=re;
    }
    vl d;
    rep(ar,0,n){
        if(ar==n-1)d=u;
        vl e(1001,0);
        rep(i,0,1001){
            ll mx=0;
                rep(j,0,i+1){
                    ll zn=0;
                    rep(l,0,3){
                        ll er=i-j+(a[l]*j)/(b[l]);
                        if(er>=1000)zn+=u[1000]/100*p[l];
                        else zn+=u[er]/100*p[l];
                    }
                    mx=max(mx,zn);
                }
            e[i]=mx;
        }
        u=e;
    }
    ll r=u[s];
    rep(i,0,8)r/=100;
    cout<<r<<endl;
    vl ans;
    rep(j,1,s+1){
                    ll zn=0;
                    rep(l,0,3){
                        ll er=s-j+(a[l]*j)/(b[l]);
                        if(er>=1000)zn+=d[1000]/100*p[l];
                        else zn+=d[er]/100*p[l];
                    }
        if(zn==u[s])ans.push_back(j);
    }
    cout<<ans.size()<<endl;
    rep(i,0,ans.size())cout<<ans[i]<<endl;
}