#include <bits/stdc++.h>
using namespace std;
const int N = 128;
const double eps = 1e-6;
int n, x;
struct Matrix {
  int n;
  double a[N][N];
  Matrix() { memset(a, 0, sizeof(a)); }
  Matrix(int n) : n(n) { memset(a, 0, sizeof(a)); }
  void init() {
    for (int i = 0; i < int(n); i++) a[i][i] = 1;
  }
  Matrix operator*(const Matrix& t) const {
    Matrix res(n);
    for (int i = 0; i < int(n); i++) {
      for (int j = 0; j < int(n); j++) {
        for (int k = 0; k < int(n); k++) {
          res.a[i][j] += a[i][k] * t.a[k][j];
        }
      }
    }
    return res;
  }
};
Matrix qmod(Matrix a, long long b) {
  Matrix res(a.n);
  res.init();
  while (b) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
double a[N];
int main() {
  for (int i = 0; i < int(N); i++) a[i] = 1;
  scanf("%d%d", &n, &x);
  for (int i = 0; i < int(x + 1); i++) scanf("%lf", &a[i]);
  if (n == 1) {
    printf("%.12lf\n", 1 - a[0]);
    return 0;
  }
  Matrix mat(N);
  for (int i = 0; i < int(N); i++) {
    for (int j = 0; j < int(x + 1); j++) {
      mat.a[i][i ^ j] += a[j];
    }
  }
  mat = qmod(mat, n);
  double res = mat.a[0][0];
  printf("%.12lf\n", 1 - res);
  return 0;
}
