#include <bits/stdc++.h>
using namespace std;
long long dp[1005];
long long sum[1005];
long long f[100005], in[100005], first[100005];
long long getncr(int N, int R) {
  return ((((f[N] * first[R]) % 1000000007ll + 1000000007ll) % 1000000007ll *
           first[N - R]) %
              1000000007ll +
          1000000007ll) %
         1000000007ll;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  f[0] = f[1] = in[0] = in[1] = first[0] = first[1] = 1;
  int i, j;
  for (i = 2; i <= 100004; i++) {
    f[i] = (1ll * f[i - 1] * i) % 1000000007ll;
    in[i] =
        (-((1ll) * (1000000007ll / i) * in[1000000007ll % i]) % 1000000007ll +
         1000000007ll) %
        1000000007ll;
    first[i] = (1ll * first[i - 1] * in[i]) % 1000000007ll;
  }
  dp[0] = 1e8;
  dp[1] = 0;
  for (i = 2; i < 1005; i++) {
    int x = __builtin_popcount(i);
    dp[i] = dp[x] + 1;
  }
  string a;
  cin >> a;
  int k;
  cin >> k;
  sum[0] = 0;
  for (i = 0; i < a.length(); i++) sum[i + 1] = ((int)(a[i] == '1')) + sum[i];
  long long s = 0;
  a = '#' + a;
  for (i = 1; i < a.length(); i++) {
    if (a[i] == '1') {
      int x = sum[i - 1];
      int y = a.length() - 1 - i;
      for (j = 0; j <= y; j++) {
        if (dp[x + j] == k - 1) {
          s += getncr(y, j);
          s %= 1000000007ll;
        }
      }
    }
  }
  if (k == 0) s++;
  if (k == 1) {
    s--;
    s = s + 1000000007ll;
    s %= 1000000007ll;
  }
  if (dp[sum[a.length() - 1]] == k - 1) {
    s += 1;
    s %= 1000000007ll;
  }
  cout << s;
  return 0;
}
