#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
const ll mod=1000000007;
ll powmod(ll a,ll b) {ll res=1;a%=mod;for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
// head

const int N=2501000;
int n,m,cnt0[N],cnt1[N];
ll m0,md,cnt2[N];
int main() {
	scanf("%d%d",&m,&n);
	scanf("%lld%lld",&m0,&md);
	rep(i,1,m+1) {
//		printf("%lld\n",m0);
		cnt0[m0]++;
		m0=(m0*58+md)%(n+1);
	}
//	puts("");
	scanf("%lld%lld",&m0,&md);
	rep(i,1,n+1) {
//		printf("%lld\n",m0);
		cnt1[m0]++; cnt2[m0]+=m0;
		m0=(m0*58+md)%(m+1);
	}
	int x=0; ll sx=0;
	rep(i,1,m+1) cnt1[i]+=cnt1[i-1],cnt2[i]+=cnt2[i-1];
	ll ans=cnt2[m];
//	puts("");
	rep(i,0,n+1) {
		rep(j,0,cnt0[i]) {
			x++; sx+=i;
			int y=cnt1[m-x];
			assert(x<=m&&y<=n);
			ll ret=(ll)(m-x)*(n-y)+cnt2[m-x]+sx;
//			printf("%lld\n",ret);
			ans=min(ans,ret);
		}
	}
	printf("%lld\n",ans);
}