// head of mylib.h #include using ll = long long; using ull = unsigned long long; using pi = std::pair; #define chmin(x, a) ((x) = std::min({(x), (a)}) #define chmax(x, a) ((x) = std::max({(x), (a)}) template class V : public std::vector { typedef std::vector vector; public: using vector::begin; using vector::end; using vector::operator[]; using vector::back; using vector::clear; using vector::const_iterator; using vector::empty; using vector::erase; using vector::front; using vector::insert; using vector::iterator; using vector::pop_back; using vector::push_back; using vector::rbegin; using vector::rend; using vector::resize; using vector::size; using vector::vector; ll sum() const { ll x = 0; std::cout << "sum()" << std::endl; return x; } ll max() const { ll x = std::numeric_limits::min(); std::cout << "max()" << std::endl; return x; } ll min() const { ll x = std::numeric_limits::max(); std::cout << "min()" << std::endl; return x; } }; template using VV = V>; template std::ostream& operator<<(std::ostream& os, const V& v) { for (auto itr = v.begin(); itr != v.end();++itr) os << (itr != v.begin() ? " " : "") << *itr; os << std::endl; return os; } template std::istream& operator>>(std::istream& is, V& v) { for (auto& i : v) is >> i; return is; } void fin(const char* str){ std::cout << str << std::endl; exit(0); } // end of mylib.h using namespace std; VV prodOR(VV A, VV B){ int a = A.size(), b = B.size(), c = B.front().size(); VV X(a, V(c, false)); for (int i = 0; i < a;++i){ for (int j = 0; j < b; ++j) { for (int k = 0; k < c; ++k) { X[i][k] = X[i][k] || (A[i][j] && B[j][k]); } } } return X; } int main() { int v, d; cin >> v >> d; V input(v); VV e(v, V(v, false)), t, res = e; for (int i = 0; i < v; ++i) res[i][i] = true; cin >> input; for (int i = 0; i < v;++i){ for (int j = 0; j < v;++j){ e[i][j] = (input[i][j] == '1'); } } t = e; while(d > 0) { if (d & 1) res = prodOR(res, t); d /= 2; t = prodOR(t, t); } cerr << res << endl; for(auto vb : res)for(auto i:vb) if (!i) return cout << "No" << endl, 0; cout << "Yes" << endl; }