#include <bits/stdc++.h>
using namespace std;
inline int add(int a, int b) {
  a += b;
  if (a >= 1000000007) a -= 1000000007;
  return a;
}
inline int sub(int a, int b) {
  a -= b;
  if (a < 0) a += 1000000007;
  return a;
}
inline int mult(int a, int b) { return (1LL * a * b) % 1000000007; }
inline int power(int a, int b) {
  int r = 1;
  while (b) {
    if (b & 1) r = mult(r, a);
    a = mult(a, a);
    b >>= 1;
  }
  return r;
}
inline int make(int x) {
  int res = 0;
  while (x) {
    res += x & 1;
    x >>= 1;
  }
  return res;
}
inline int get(int x) {
  int res = 1;
  while (x > 1) {
    x = make(x);
    ++res;
  }
  return res;
}
inline string bin(int x) {
  string res = "";
  while (x) {
    res += ('0' + (x & 1));
    x >>= 1;
  }
  reverse(res.begin(), res.end());
  return res;
}
int n, K;
char second[1011];
int d[1011];
int C[1011][1011];
int main() {
  d[1] = 1;
  for (int i = 2; i < 1011; ++i) {
    int t = make(i);
    d[i] = d[t] + 1;
  }
  for (int i = 0; i < 1011; ++i) {
    C[i][0] = C[i][i] = 1;
    for (int j = 1; j < i; ++j) {
      C[i][j] = add(C[i - 1][j - 1], C[i - 1][j]);
    }
  }
  scanf("%s", second);
  scanf("%d", &K);
  if (K == 0) {
    puts("1");
    return 0;
  }
  n = strlen(second);
  if (n == 1 && second[0] == '1' && K == 1) {
    puts("0");
    return 0;
  }
  int ans = 0;
  for (int kk = 1; kk < 1011; ++kk) {
    int k = kk;
    if (d[k] != K) continue;
    for (int i = 0; i < n; ++i) {
      int rem = n - 1 - i;
      if (second[i] == '1') {
        int t = C[rem][k];
        if (K == 1 && t > 0) t = sub(t, 1);
        ans = add(ans, t);
        --k;
      }
      if (k <= 0) {
        ans = add(ans, 1);
        break;
      }
    }
  }
  printf("%d\n", ans);
  return 0;
}
