#include <bits/stdc++.h>
using namespace std;
const long long MOD = (long long)1e9 + 7;
long long k, C[1003][1003], dp[1003], cnt, num;
string str;
inline int getbit(int x) {
  int ans = 0;
  while (x) {
    if (x & 1) ++ans;
    x >>= 1;
  }
  return ans;
}
int main() {
  cin >> str >> k;
  if (!k) return puts("1"), 0;
  for (int i = 0; i <= 1000; ++i) C[i][0] = 1;
  for (int i = 1; i <= 1000; ++i) {
    for (int j = 1; j <= 1000; ++j)
      C[i][j] = (C[i - 1][j - 1] + C[i - 1][j]) % MOD;
  }
  dp[1] = 0;
  for (int i = 2; i <= 1000; ++i) dp[i] = dp[getbit(i)] + 1;
  int N = str.size();
  for (int i = 0; i < N; ++i) {
    if (str[i] == '0') continue;
    for (int j = max(1LL, cnt); j < N; ++j) {
      if (dp[j] == k - 1) {
        num = (num + C[N - 1 - i][j - cnt]) % MOD;
      }
    }
    ++cnt;
  }
  if (k == 1) --num;
  if (dp[cnt] == k - 1) num = (num + 1) % MOD;
  cout << num << endl;
  return 0;
}
