#include <bits/stdc++.h>
using namespace std;
unordered_map<
    long long,
    unordered_map<long long, pair<pair<long long, long long>, long long> > >
    inpmt;
vector<long long> dcp;
void SieveOfErat() {
  bool prime[1000001];
  memset(prime, true, sizeof(prime));
  for (long long vec = 2; vec * vec <= 1000000; vec++) {
    if (prime[vec] == true) {
      for (long long dd = vec * 2; dd <= 1000000; dd += vec) prime[dd] = false;
    }
  }
}
long long gcd(long long aa, long long id2) {
  if (aa == 0) {
    return id2;
  } else
    return gcd(aa % id2, id2);
}
struct vect {
  struct vect *foll;
  long long calc;
  struct vect *succ;
};
const int base = 1e9 + 7;
int a[1009], k, n;
int f[1009][1009][3], ans;
string s;
int xc(int k) { return (__builtin_popcount(k)); }
int cal(int i, int cnt, int ok) {
  if (cnt < 0) return 0;
  if (f[i][cnt][ok] != -1) return f[i][cnt][ok];
  if (i >= s.size()) return f[i][cnt][ok] = (cnt == 0);
  int res = 0;
  for (int j = 0; j <= 1; ++j) {
    if (ok || s[i] - '0' >= j)
      res = (res + cal(i + 1, cnt - j, ok || s[i] - '0' > j)) % base;
  }
  return f[i][cnt][ok] = res;
}
int main() {
  cin >> s;
  cin >> k;
  if (k == 0) {
    cout << 1;
    return 0;
  }
  memset(f, -1, sizeof(f));
  a[1] = -1;
  for (int i = 1; i < 1009; ++i) {
    a[i] = a[xc(i)] + 1;
    if (a[i] + 1 == k) {
      int tmp = cal(0, i, 0);
      ans = (ans + tmp) % base;
    }
  }
  if (k == 1) ans = (ans - 1 + base) % base;
  cout << ans;
}
