#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 2500005;

ll sa[MAX_N],sb[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll m,n,u1,v1,u2,v2;
    cin >> m >> n >> u1 >> v1 >> u2 >> v2;
    vl a(m),b(n);
    rep(i,m){
        a[i] = u1;
        u1 = (u1*58+v1) % (n+1);
    }
    rep(i,n){
        b[i] = u2;
        u2 = (u2*58+v2) % (m+1);
    }
    sort(all(a)),sort(all(b));
    rep(i,m){
        sa[i+1] = sa[i] + a[i];
    }
    rep(i,n){
        sb[i+1] = sb[i] + b[i];
    }
    ll ans = (1LL << 60);
    rep(i,m+1){
        int cnt = upper_bound(all(b),i) - b.begin();
        cmn(ans,sa[m-i]+i*(n-cnt)+sb[cnt]);
    }
    cout << ans << "\n";
    return 0;
}


### Prompt

Please provide a cpp coded solution to the problem described below:

Example

Input

2 3 1 3 1 0


Output

2

### Response

```cpp
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 2500005;

ll sa[MAX_N],sb[MAX_N];

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll m,n,u1,v1,u2,v2;
    cin >> m >> n >> u1 >> v1 >> u2 >> v2;
    vl a(m),b(n);
    rep(i,m){
        a[i] = u1;
        u1 = (u1*58+v1) % (n+1);
    }
    rep(i,n){
        b[i] = u2;
        u2 = (u2*58+v2) % (m+1);
    }
    sort(all(a)),sort(all(b));
    rep(i,m){
        sa[i+1] = sa[i] + a[i];
    }
    rep(i,n){
        sb[i+1] = sb[i] + b[i];
    }
    ll ans = (1LL << 60);
    rep(i,m+1){
        int cnt = upper_bound(all(b),i) - b.begin();
        cmn(ans,sa[m-i]+i*(n-cnt)+sb[cnt]);
    }
    cout << ans << "\n";
    return 0;
}


```