![在这里插入图片描述](https://i-blog.csdnimg.cn/blog_migrate/aff7fcfb19eae0388f8167eebed2a5c0.png)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=52;
ll n,k;
ll a[N][N],s[N][N];
bool judge()
{
if(k>s[n][n])return 0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
for(int k1=i;k1<=n;k1++)
{
for(int k2=j;k2<=n;k2++)
{
ll tmp=s[k1][k2]-(s[i-1][k2]+s[k1][j-1]-s[i-1][j-1]);
if(tmp==k)return 1;
}
}
}
}
return 0;
}
int main()
{
ios::sync_with_stdio(false);
while(cin>>n>>k)
{
memset(s,0,sizeof(s));
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin>>a[i][j];
s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
}
}
if(judge())printf("yes\n");
else printf("no\n");
}
return 0;
}