# Light OJ 1261 – K-SAT Problem

```
/*
*/

#include &lt;bits/stdc++.h&gt;

#define pii pair &lt;int,int&gt;
#define sc scanf
#define pf printf
#define Pi 2*acos(0.0)
#define ms(a,b) memset(a, b, sizeof(a))
#define pb(a) push_back(a)
#define MP make_pair
#define oo 1&lt;&lt;29
#define dd double
#define ll long long
#define EPS 10E-10
#define ff first
#define ss second
#define MAX 10000
#define SZ(a) (int)a.size()
#define getint(a) scanf(&quot;%d&quot;,&amp;a)
#define loop(i,n) for(int i=0;i&lt;n;i++)
#define TEST_CASE(t) for(int z=1;z&lt;=t;z++)
#define PRINT_CASE printf(&quot;Case %d: &quot;,z)
#define all(a) a.begin(),a.end()
#define intlim 2147483648
#define inf 1000000
#define rtintlim 46340
#define llim 9223372036854775808
#define rtllim 3037000499
#define ull unsigned long long
#define I int

using namespace std;

/* Bits operation */
int Set(int n,int pos)  { return n = n | 1&lt;&lt;pos;}
bool check(int n,int pos) { return n &amp; 1&lt;&lt;pos;}
int Reset(int n, int pos) { return n=n &amp; ~(1&lt;&lt;pos);}

int main()
{
///freopen(&quot;in.txt&quot;,&quot;r&quot;,stdin);
///freopen(&quot;out.txt&quot;,&quot;w&quot;,stdout);
vector&lt;int&gt;v[32];
bool ara[32];
int t;
getint(t);
TEST_CASE(t)
{
ms(ara,0);
int n,m,k,p,num;
cin&gt;&gt;n&gt;&gt;m&gt;&gt;k;
for(int i=1;i&lt;=n;i++)
{
v[i].pb(0);
for(int j=1;j&lt;=k;j++)
{
cin&gt;&gt;num;
v[i].pb(num);
}
}

cin&gt;&gt;p;
loop(i,p)
{
cin&gt;&gt;num;
ara[num]=1;
}

bool test1=0,test2=0;
for(int i=1;i&lt;=n;i++)
{
test1=0;
for(int j=1;j&lt;=k;j++)
{
if(v[i][j]&gt;0 &amp;&amp; ara[v[i][j]])
test1=1;
if(v[i][j]&lt;0 &amp;&amp; !ara[-v[i][j]])
test1=1;
}
if(test1==0)
test2=1;
}
PRINT_CASE;
if(test2)
cout&lt;&lt;&quot;No&quot;&lt;&lt;endl;
else
cout&lt;&lt;&quot;Yes&quot;&lt;&lt;endl;
loop(i,n+1)
v[i].clear();
}
return 0;
}

```