#include <iostream>
#include <iomanip>
#include <map>
#include <set>
#include <cmath>
#include <vector>
#include <climits>
#include <string>
#include <algorithm>
#include <sstream>
using namespace std;

vector<string> split(string haystack, string needle) {
    vector<string> result;
    int startPos = 0;
    int foundPos = haystack.find(needle, startPos);
    while (foundPos != string::npos) {
        int count = foundPos - startPos;
        string token = haystack.substr(startPos, count);
        if (!token.empty()) {
            result.push_back(token);
        }
        startPos = foundPos + needle.length();
        foundPos = haystack.find(needle, startPos);
    }
    string token = haystack.substr(startPos, haystack.length() - startPos);
    if (!token.empty()) {
        result.push_back(token);
    }
    return result;
}

string nameConvert(const string& name) {
    const string DELIMITER = " ";
    stringstream builder;
    auto parts = split(name, DELIMITER);
    for (auto part : parts) {
        part[0] = toupper(part[0]);
        transform(part.begin() + 1, part.end(), part.begin() + 1, ::tolower);
        builder << part << DELIMITER;
    }
    return builder.str();
}

string dateConvert(const string& date) {
    const string DELIMITER = "/";
    stringstream builder;
    auto parts = split(date, DELIMITER);
    builder << setw(2) << setfill('0') << parts[0] << DELIMITER;
    builder << setw(2) << setfill('0') << parts[1] << DELIMITER;
    builder << parts[2];
    return builder.str();
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    

    string n;cin >> n;
    int k;cin >> k;

    for (int i = n.length() - 1;i >= n.length() - k;i--) {
        if (n[i] == '1') {
            cout << "NO";
            return 0;
        }
    }
    cout << "YES";
    return 0;
}