#include <bits/stdc++.h>
using namespace std;
const int N = 2010, mod = 1e9 + 7;
int num[N], c[N][N], f[N];
int main() {
  for (int i = 1; i < N; ++i) {
    c[i][0] = 1;
    c[0][i] = 0;
  }
  c[0][0] = 1;
  for (int i = 1; i < N; ++i) {
    for (int j = 1; j <= i; ++j) {
      c[i][j] = (c[i - 1][j] + c[i - 1][j - 1]) % mod;
    }
  }
  f[1] = 0;
  for (int i = 2; i < N; ++i) {
    int tmp = i;
    int cnt = 0;
    while (tmp != 0) {
      if (tmp % 2 == 1) {
        ++cnt;
      }
      tmp /= 2;
    }
    f[i] = 1 + f[cnt];
  }
  char ch;
  int n = 0;
  while (1) {
    ch = getchar();
    if (!isdigit(ch)) {
      break;
    }
    num[++n] = ch - '0';
  }
  int k, cntPref = 0, ans = 0;
  scanf("%d", &k);
  for (int i = 1; i <= n; ++i) {
    if (num[i] == 1) {
      for (int j = 0; j <= n - i; ++j) {
        if (cntPref + j <= 1) {
          continue;
        }
        if (1 + f[cntPref + j] == k) {
          ans = (ans + c[n - i][j]) % mod;
        }
      }
      ++cntPref;
    }
  }
  if (cntPref > 1) {
    if (f[cntPref] + 1 == k) {
      ans = (ans + 1) % mod;
    }
  }
  if (n == 1) {
    if (k == 0) {
      printf("1\n");
    } else {
      printf("0\n");
    }
    return 0;
  }
  if (k == 0) {
    ans = (ans + 1) % mod;
  } else if (k == 1) {
    ans = (ans + n - 1) % mod;
  }
  printf("%d", ans);
  return 0;
}
