#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll e16=1e16;

ll x[],y[];

void solve(){

    ll x0,y0,ax,ay,bx,by,xs,ys,t;

    cin>>x0>>y0>>ax>>ay>>bx>>by>>xs>>ys>>t;

    x[]=x0;

    y[]=y0;

    ll i,j,mxn,ans,ansd,td;

    for(i=;x[i-]<=e16&&y[i-]<=e16;i++){

        x[i]=x[i-]*ax+bx;

        y[i]=y[i-]*ay+by;

    }

    mxn=i-;

    ans=;

    for(i=;i<=mxn;i++){

        ansd=;

        td=t;

        if((td=td-abs(xs-x[i])-abs(ys-y[i]))>=)

            ansd++;

        for(j=i-;j>=&&td>;j--){

            if((td=td-abs(x[j+]-x[j])-abs(y[j+]-y[j]))>=)

                ansd++;

        }

        if(td>&&(td=td-abs(x[i+]-x[])-abs(y[i+]-y[]))>=)

            ansd++;

        for(j=i+;j<=mxn&&td>;j++){

            if((td=td-abs(x[j]-x[j-])-abs(y[j]-y[j-]))>=)

                ansd++;

        }

        ans=max(ans,ansd);

    }

    cout<<ans<<endl;

}

int main(){

    ios::sync_with_stdio();

    cin.tie();cout.tie();

    solve();

    return ;

}