#define TEMPLATE_USED #include using namespace std; typedef long long ll; typedef vector vl; typedef vector vvl; typedef pair pl; typedef vector vp; const ll INF=1001001001; const ll LINF=1001001001001001001; const ll D4[]={0,1,0,-1,0}; const ll D8[]={0,1,1,0,-1,-1,1,-1,0}; #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) for(ll i=0;i<(n);++i) #define _rep3(i,a,b) for(ll i=(ll)(a);i<(ll)(b);++i) #define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2)(__VA_ARGS__) #define _repe2(i,n) for(ll i=0;i<=(ll)(n);++i) #define _repe3(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);++i) #define repe(...) _overload3(__VA_ARGS__,_repe3,_repe2)(__VA_ARGS__) #define _rrep2(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define _rrep3(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2)(__VA_ARGS__) #define _rrepe2(i,n) for(ll i=(ll)(n);i>=0;i--) #define _rrepe3(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);i--) #define rrepe(...) _overload3(__VA_ARGS__,_rrepe3,_rrepe2)(__VA_ARGS__) #define all(x) (x).begin(),(x).end() template bool chmax(T &a,const T &b){if(a bool chmin(T &a,const T &b){if(b using pq=priority_queue,greater>; void solve(); int main(){ cin.tie(0); ios::sync_with_stdio(0); solve(); } struct UnionFind { vector par; ll g_sz; UnionFind(int sz):g_sz(sz){ par.assign(sz+1,-1); } bool unite(int x,int y){ x=find(x),y=find(y); if(x==y)return false; --g_sz; if(par[x]>par[y])swap(x,y); par[x]+=par[y]; par[y]=x; return true; } int find(int x){ if(par[x]<0)return x; return par[x]=find(par[x]); } int size(int x){ return -par[find(x)]; } }; void solve(){ ll n;cin>>n; double p;cin>>p; vector r(n+1,1.0); double ans=0; repe(i,2,n){ ans+=r[i]; for(ll j=i+i;j<=n;j+=i)r[j]*=1-p; } cout<