CF765G Math, math everywhere

Description

If you have gone that far, you'll probably skip unnecessary legends anyway... You are given a binary string ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF765G/6f5e6f7df69128977b79b7463c73fb36b053692e.png) and an integer ![](https://cdn.luogu.com.cn/upload/vjudge_pic/CF765G/751b745076fc47afb357605550109735f432dc0d.png). Find the number of integers $ k $ , $ 0

Input Format

In the first line of input there is a string $ s $ consisting of $ 0 $ 's and $ 1 $ 's ( $ 1

Output Format

A single integer — the answer to the problem.