#include <bits/stdc++.h>
using namespace std;
void read(int &x) {
  x = 0;
  int f = 1;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    if (ch == '-') f = -f;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  x *= f;
}
void print(int x) {
  if (x < 0) putchar('-'), x = -x;
  if (!x) return;
  print(x / 10), putchar(x % 10 + 48);
}
void write(int x) {
  if (!x)
    putchar('0');
  else
    print(x);
  putchar('\n');
}
const int maxn = 1e3 + 10;
const int inf = 1e9;
const double eps = 1e-8;
const int mod = 1e9 + 7;
char s[maxn];
int n, k, g[maxn], f[maxn][maxn][2];
void add(int &x, int y) {
  x += y;
  if (x >= mod) x -= mod;
}
int main() {
  scanf("%s", s + 1), n = strlen(s + 1), read(k);
  for (int i = 2; i <= n; i++) g[i] = g[__builtin_popcount(i)] + 1;
  f[0][0][1] = 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= i; j++) {
      add(f[i][j][0], f[i - 1][j][0]);
      if (s[i] == '1') add(f[i][j][0], f[i - 1][j][1]);
      if (j) add(f[i][j][0], f[i - 1][j - 1][0]);
      if (j >= (s[i] == '1')) f[i][j][1] = f[i - 1][j - (s[i] == '1')][1];
    }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    if (g[i] + 1 != k) continue;
    add(ans, (f[n][i][0] + f[n][i][1] - (i == 1)) % mod);
  }
  write(k ? ans : 1);
  return 0;
}
