///vaianta 1 cu backtracking
/*#include <fstream>
#include <iomanip>

using namespace std;

ifstream in("dezastru.in");
ofstream out("dezastru.out");

int n,k;
int v[20];
float v2[30];
long double suma=0;
long double cnk=0;

int verificare(int nivel)
{
    bool ok=0;
    for(int i=1; i<nivel; i++)
    {
        if(v[i]!=v[nivel]) ok=0;
        else
        {
            ok=1;
            break;
        }
    }
    if(ok==0) return 0;
    return 1;

}

void afisare()
{
    long double q=1;
    for(int i=1; i<=k; i++) q=q*v2[v[i]];
    cnk++;
    suma+=q;
    ///out<<q<<" ";
}

void btk (int nivel)
{
    for(int i=1; i<=n; i++)
    {
        v[nivel]=i;
        if(verificare(nivel)==0)
        {
            if((nivel+1)>n)
            {
                afisare();
            }
            else
            {
                btk(nivel+1);
            }
        }
    }
}

int main()
{
    in>>n>>k;
    for(int j=1;j<=n;j++) in>>v2[j];
    btk(1);

    ///cnk=combinari de n luate cate k

    suma=suma/cnk;
    out<<fixed<<setprecision(6)<<suma;

    in.close();
    out.close();
    return 0;
}
*/
#include<fstream>
#include<iomanip>
using namespace std;

ifstream in("dezastru.in");
ofstream out("dezastru.out");

int n,k,i,j;
double a[30][30],v[30],nr;

int main()
{
    in>>n>>k; nr=1;
    for (i=1;i<=n;i++) in>>v[i],a[i][0]=1;
    for (i=n-k+1;i<=n;i++) nr=nr*i;
    for (i=1;i<=k;i++) nr=nr/i;
    a[0][0]=1;
    for (i=1;i<=n;i++)
    for (j=1;j<=k;j++)
    a[i][j]=a[i-1][j]+(a[i-1][j-1]*v[i]);
    out<<fixed<<setprecision(6)<<a[n][k]/nr;
    return 0;
}