#include <bits/stdc++.h>
template <typename T>
class IntegerIterator
    : public std::iterator<std::input_iterator_tag, T, std::ptrdiff_t, T*, T> {
 public:
  explicit IntegerIterator(int value) : value(value) {}
  IntegerIterator& operator++() {
    ++value;
    return *this;
  }
  IntegerIterator operator++(int) {
    IntegerIterator copy = *this;
    ++value;
    return copy;
  }
  IntegerIterator& operator--() {
    --value;
    return *this;
  }
  IntegerIterator operator--(int) {
    IntegerIterator copy = *this;
    --value;
    return copy;
  }
  T operator*() const { return value; }
  bool operator==(IntegerIterator rhs) { return value == rhs.value; }
  bool operator!=(IntegerIterator rhs) { return !(*this == rhs); }

 private:
  T value;
};
template <typename T>
class IntegerRange {
 public:
  IntegerRange(T begin, T end) : begin_(begin), end_(end) { ; }
  IntegerIterator<T> begin() const { return IntegerIterator<T>(begin_); }
  IntegerIterator<T> end() const { return IntegerIterator<T>(end_); }

 private:
  T begin_;
  T end_;
};
template <typename T>
class ReversedIntegerRange {
 public:
  ReversedIntegerRange(T begin, T end) : begin_(begin), end_(end) { ; }
  std::reverse_iterator<IntegerIterator<T>> begin() const {
    return std::reverse_iterator<IntegerIterator<T>>(
        IntegerIterator<T>(begin_));
  }
  std::reverse_iterator<IntegerIterator<T>> end() const {
    return std::reverse_iterator<IntegerIterator<T>>(IntegerIterator<T>(end_));
  }

 private:
  T begin_;
  T end_;
};
template <typename T>
IntegerRange<T> range(T to) {
  return IntegerRange<T>(0, to);
}
template <typename T>
IntegerRange<T> range(T from, T to) {
  return IntegerRange<T>(from, to);
}
template <typename T>
IntegerRange<T> inclusiveRange(T to) {
  return IntegerRange<T>(0, to + 1);
}
template <typename T>
IntegerRange<T> inclusiveRange(T from, T to) {
  return IntegerRange<T>(from, to + 1);
}
template <typename T>
ReversedIntegerRange<T> downrange(T from) {
  return ReversedIntegerRange<T>(from, 0);
}
template <typename T>
ReversedIntegerRange<T> downrange(T from, T to) {
  return ReversedIntegerRange<T>(from, to);
}
template <typename T>
ReversedIntegerRange<T> inclusiveDownrange(T from) {
  return ReversedIntegerRange<T>(from + 1, 0);
}
template <typename T>
ReversedIntegerRange<T> inclusiveDownrange(T from, T to) {
  return ReversedIntegerRange<T>(from + 1, to);
}
using namespace std;
class TaskC {
 public:
  int64_t k;
  void solve(std::istream& in, std::ostream& out) {
    int n;
    in >> n >> k;
    ++n;
    vector<int64_t> values(n);
    for (int i : range(n)) {
      in >> values[i];
    }
    for (int j : range(2)) {
      if (try_solve(values, out)) {
        return;
      }
      for (int i : range(values.size())) {
        values[i] = -values[i];
      }
    }
  }
  bool try_solve(vector<int64_t> values, std::ostream& out) {
    int n = (int)values.size();
    vector<int64_t> v((unsigned long)(n + 120));
    for (int i : range(n)) {
      for (int j : range(32)) {
        if (values[i] > 0) {
          if ((1LL << j) & values[i]) {
            ++v[i + j];
          }
        } else {
          if ((1LL << j) & (-values[i])) {
            --v[i + j];
          }
        }
      }
    }
    int64_t carry = 0;
    for (size_t i : range(v.size())) {
      int64_t cur = carry + v[i];
      carry = cur / 2;
      v[i] = int(cur % 2);
      if (v[i] == -1) {
        --carry;
        v[i] = 1;
      }
      assert(v[i] == 0 || v[i] == 1);
    }
    if (carry < 0) {
      return false;
    }
    assert(!carry);
    int mx = -1;
    for (int i : range(v.size())) {
      if (v[i]) {
        mx = i;
      }
    }
    assert(mx != -1);
    int answer = 0;
    for (size_t i : range(values.size())) {
      if (mx - i > 32) {
        if (v[i]) {
          out << answer;
          return true;
        }
        continue;
      }
      int64_t need_subtract = 0;
      for (int j : range(33)) {
        need_subtract += ((1LL * v[i + j]) << j);
      }
      if (values[i] - need_subtract >= -k) {
        if (i != n - 1 || values[i] - need_subtract != 0) ++answer;
      }
      if (v[i]) {
        out << answer;
        return true;
      }
    }
    out << answer;
    return true;
  }
};
int main() {
  std::ios_base::sync_with_stdio(false);
  TaskC solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  in.tie(0);
  out << std::fixed;
  out.precision(20);
  solver.solve(in, out);
  return 0;
}
