#include <bits/stdc++.h>
using namespace std;
const long long linf = (1LL << 62) - 1;
const int inf = 1010101043;
void pause(bool a = true) {}
long double PI = acos(-1);
template <class T>
inline const T sqr(const T& x) {
  return x * x;
}
template <class T>
inline T dist(pair<T, T> a, pair<T, T> b) {
  return sqrt(sqr(a.first - b.first) + sqr(a.second - b.second));
}
template <class T>
inline T prod(pair<T, T> a, pair<T, T> b, pair<T, T> c = make_pair(0, 0)) {
  return (a.first - c.first) * (b.second - c.second) -
         (a.second - c.second) * (b.first - c.first);
}
template <class T>
inline T prodv(pair<T, T> a, pair<T, T> b, pair<T, T> c = make_pair(0, 0)) {
  return (a.first - c.first) * (b.first - c.first) +
         (a.second - c.second) * (b.second - c.second);
}
template <class T>
inline bool intriangle(pair<T, T> a, pair<T, T> b, pair<T, T> c, pair<T, T> d) {
  return (abs(prod(a, b, c)) ==
          abs(prod(a, b, d)) + abs(prod(a, c, d)) + abs(prod(b, c, d)));
}
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return a * b / gcd(a, b); }
long long popcnt(long long mask) {
  long long cnt = 0;
  while (mask) cnt += mask & 1, mask >>= 1;
  return cnt;
}
unsigned long long powi(unsigned long long a, unsigned long long b,
                        long long mod = 1000000007) {
  if (b < 2) return b ? a : 1;
  return (powi((a * a) % mod, b / 2, mod) * (b % 2 ? a : 1LL)) % mod;
}
template <class T>
bool maxz(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool minz(T& a, T b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool maxze(T& a, T b) {
  if (a <= b) {
    a = b;
    return true;
  }
  return false;
}
template <class T>
bool minze(T& a, T b) {
  if (a >= b) {
    a = b;
    return true;
  }
  return false;
}
long long mod7 = 1000000007;
long long mod9 = 1000000009;
bool isprime(long long n) {
  if (n < 2) return 0;
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) return 0;
  return 1;
}
vector<vector<long double>> m(const vector<vector<long double>>& a,
                              const vector<vector<long double>>& b) {
  vector<vector<long double>> c(a.size(), vector<long double>(b.size(), 0));
  for (int i = 0; i < (a.size()); i++)
    for (int j = 0; j < (a.size()); j++)
      for (int k = 0; k < (a.size()); k++) c[i][j] += a[i][k] * b[k][j];
  return c;
}
vector<vector<long double>> powm(const vector<vector<long double>>& a,
                                 long long b) {
  if (b == 1) return a;
  if (b & 1)
    return m(powm(m(a, a), b / 2), a);
  else
    return powm(m(a, a), b / 2);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long n, x;
  cin >> n >> x;
  x++;
  vector<long double> p(x);
  for (int i = 0; i < (x); i++) {
    cin >> p[i];
  }
  vector<vector<long double>> m(128, vector<long double>(128, 0));
  for (int i = 0; i < (128); i++)
    for (int j = 0; j < (128); j++) {
      if ((i ^ j) < x) m[i][j] = p[i ^ j];
    }
  m = powm(m, n);
  cout << fixed << setprecision(7) << 1 - m[0][0] << endl;
  pause(0);
  return 0;
}
