#include <iostream>
#include <vector>
#include <fstream>
#include <cstdlib>

using namespace std;


vector<int> v;
int k;

int find_st(int l, int r) {

    if (l < r) {
        int i, j, p;
        p = v[l + rand()%(r - l + 1)];
        i = l;
        j = r;

        while (i <= j) {
            while (v[i] < p) {
                i++;
            }
            while (v[j] > p) {
                j--;
            }
            if (i >= j)
                break;
            swap(v[i++], v[j--]);
        }

        if (j == k) {
            return v[j];
        } else if (k < j) {
            find_st(l, j);
        } else if (k > j) {
            find_st(j+1, r);
        }




    }

}


int main() {

    //---------------------------------------------
    freopen("kth.in", "r", stdin);
    freopen("kth.out", "w", stdout);
    //--------------------------------------------- /*/

    int n, A, B, C, a1, a2;
    cin >> n >> k >> A >> B >> C >> a1 >> a2;

    v.push_back(a1);
    v.push_back(a2);
    for (int i = 2; i <= n; ++i) {
        v.push_back(A*v[i - 2] + B*v[i - 1] + C);
    }

    /*
    for (int i = 0; i < n; ++i) {
        cout << v[i] << " ";
    }
    */

    k--;

    cout << find_st(0, n-1);

}