n,m=map(int,input().split())
dp=[[0 for i in range(n+1)]for j in range(m+1)]
for i in range(1,m+1):
for j in range(1,n+1):
if j>i:
dp[i][j]=0
elif j==1:
dp[i][j]=pow(1/n,i-1) # dp[i][j]表示已经收集到全部j种时的
else:
dp[i][j]=(dp[i-1][j])*(j*1.0/n) + (dp[i-1][j-1])*((n-j+1)*1.0/n)
print("{:.4f}".format(dp[m][n]))