#include "bits/stdc++.h"
using namespace std;
using ll = long long;
ll MOD = 1000000007;
ll INF = (1ll<<60);
using ld = long double;
#define rep(i,n) for(int i=0;i<n;i++)

#define dout(a) cout << fixed << setprecision(20) << a << endl;

ld dis(ld x, ld y) {
    return x*x + y*y;
}
static const ld eps = 1e-12;
tuple<ld, ld, ld> solve(vector<pair<ld, ld>> p){
    int n = p.size();
    ld x = 0, y = 0;
    rep(i, n) {
        x += p[i].first;
        y += p[i].second;
    }
    x /= ld(n);
    y /= ld(n);
    ld r = 0.995;
    ld d = 3e8;
    
    rep(_, 4800) {
        int id = -1;
        ld m = -1;
        rep(i, n) {
            ld ret = dis(x - p[i].first, y - p[i].second);
            if(ret > m) {
                m = ret;
                id = i;
            }
        }
        ld X = p[id].first - x;
        ld Y = p[id].second - y;
        m = sqrtl(m);
        X /= m;
        Y /= m;
        X *= d;
        Y *= d;
        x += X;
        y += Y;
        d *= r;
    }
    ld m = -eps;
    rep(i, n) {
        ld ret = dis(x - p[i].first, y - p[i].second);
        if(ret > m) {
            m = ret;
        }
    }
    return {sqrtl(m), x, y};
}

int main(){
    
    ll n,k,X;
    cin >> n >> k >> X;
    if(n == k){
        cout << 0.0 << endl;
        return 0;
    }

    vector<ld> x(n), y(n);
    rep(i,n){
        x[i] = X;
        X = X*233811181+1;
        X %= (1ll<<31)-1;
        y[i] = X;
        X = X*233811181+1;
        X %= (1ll<<31)-1;
    }

    ld ans = INF;
    if(n-k>11){
        ld sx, sy, sr;
        ld ep = 8.1;
        {
            vector<pair<ld, ld>> p;
            for(int j=0; j<n-k+1; j++) p.emplace_back(x[j], y[j]);
            auto[r, x, y] = solve(p);
            ans = min(ans, r);
            sx = x, sy = y, sr = r;

        }
        for(int i=1; i+n-k+1<=n; i++){
            ld R = sqrtl(dis(sx - x[i-1], sy - y[i-1]));
            ld R2 = sqrtl(dis(sx - x[i+n-k], sy - y[i+n-k]));
            if(R > sr - ep || R2 > sr){
                vector<pair<ld, ld>> p;
                for(int j=i; j<i+n-k+1; j++) p.emplace_back(x[j], y[j]);
                auto[a,b,c] = solve(p);
                ans = min(ans, a);
                sr = a;
                sx = b;
                sy = c;
            }
        }
    }else{
        vector<vector<ld>> dp(n+1, vector<ld>(10, 10000000000000000.0));
        dp[0][0] = 0.0;
        for(int i=0;i<n; i++){
            for(int j=0;j<10;j++) dp[i+1][j] = min(dp[i][j], dp[i+1][j]);
            for(int j=1;j<10&&i+j<n;j++){
                vector<pair<ld, ld>> p;
                for(int k=i; k<=i+j; k++) p.emplace_back(x[k], y[k]);
                auto[r,a,b] = solve(p);
                for(int k=0; k+j<10;k++) dp[i+j+1][k+j] = min(dp[i+j+1][k+j], dp[i][k]+r);
            }
        }
        ans = dp[n][n-k];
    }
    dout(ans);

}