#include<cstdio>

#include<cstring>

#include<cmath>

#include<iostream>

#include<algorithm>

#include<queue>

#include<vector>

using namespace std;

const int maxn = ;

const int maxe = ;

const int INF = 0x3f3f3f;

int n,m,k;

struct node{

    int type,x,y,z;

}a[];

struct TwoSat{

    int n;

    int mark[maxn*];

    int s[maxn*],cnt;

    vector<int> G[maxn*];

    void init(int n){

        this->n = n;

        for(int i=;i<=*n+;i++)  G[i].clear();

        memset(mark,,sizeof(mark));

    }

    void add_clause1or3(int u,int uval,int v,int vval){

        u = u* + uval;      //u与v不共存；

        v = v* + vval;

        G[u].push_back(v^);

        G[v].push_back(u^);

    }

    void add_clause2(int u,int uval,int v,int vval){

        u = u* + uval;

        v = v* + vval;

        G[u].push_back(v);

        G[v^].push_back(u^);

    }

    void add_clause4(int u,int uval,int v,int vval){

        u = u* + uval;

        v = v* + vval;

        G[u^].push_back(v);

        G[u].push_back(v^);

        G[v^].push_back(u);

        G[v].push_back(u^);

    }

    bool JudgeWrong(){

        for(int i=;i<k;i++){

            if(a[i].type == ){

                int x = *a[i].x+,y = *a[i].y+,z = *a[i].z+;

                if(mark[x] && mark[y] && mark[z]) return true;

            }

            if(a[i].type == ){

                int x = *a[i].x,y = *a[i].y,z = *a[i].z;

                if(mark[x] && mark[y] && mark[z]) return true;

            }

        }

        return false;

    }

    bool dfs(int u){

        if(mark[u^])   return false;

        if(mark[u])     return true;

        mark[u] = true;

        s[cnt++] = u;

        if(JudgeWrong())     return false;

        for(int i=;i<G[u].size();i++)

            if(!dfs(G[u][i]))  return false;

        return true;

    }

    bool solve(){

        for(int i=;i<=*n;i+=)

            if(!mark[i] && !mark[i+]){

                cnt = ;

                if(!dfs(i)){

                    while(cnt > )    mark[s[--cnt]] = false;       //要回溯；

                    if(!dfs(i+))  return false;

                }

            }

        return true;

    }

    void print(){

        int ans[maxn],pv = ;

        for(int i=;i<=*n;i+=)

            if(mark[i])  ans[pv++] = i/;

        printf("%d",pv);

        for(int i=;i<pv;i++)  printf(" %d",ans[i]);

        printf(".\n");

    }

}solver;

int main()

{

    //freopen("E:\\acm\\input.txt","r",stdin);

    int T;

    cin>>T;

    for(int t=;t<=T;t++){

        scanf("%d %d %d",&n,&m,&k);

        solver.init(n);

        for(int i=;i<=m;i++){

            int type,x,y;

            scanf("%d %d %d",&type,&x,&y);

            if(type == )         solver.add_clause1or3(x,,y,);

            else if(type == )    solver.add_clause2(x,,y,);

            else if(type == )    solver.add_clause1or3(x,,y,);

            else                  solver.add_clause4(x,,y,);

        }

        for(int i=;i<k;i++)

            scanf("%d %d %d %d",&a[i].type,&a[i].x,&a[i].y,&a[i].z);

        if(solver.solve()){

            printf("Case %d: Possible ",t);

            solver.print();

        }

        else   printf("Case %d: Impossible.\n",t);

    }

}