/*

 LCS 最长公共子序列

 */

 #include<stdio.h>

 #include<string.h>

 #include<stdlib.h>

 #include<algorithm>

 #include<iostream>

 #include<queue>

 #include<map>

 #include<math.h>

 using namespace std;

 typedef long long ll;

 //typedef __int64 int64;

 const int maxn = ;

 const int inf = 0x7fffffff;

 const double pi=acos(-1.0);

 const double eps = 1e-;

 int dp[ maxn ][ maxn ];

 char s1[ maxn ],s2[ maxn ];

 bool ss[  ][  ];

 //map<char,char>mp;

 void init(){

     memset( dp,,sizeof( dp ) );

     //for( int i=0;i<26;i++ ){

         //mp[ 'a'+i ] = '@';

     //}

     memset( ss,false,sizeof( ss ) );

 }

 bool same( int x,int y ){

     if( s1[x]==s2[y]||ss[s2[y]-'a'][s1[x]-'a']==true ) return true;

     else return false;

 }

 int main(){

     int T;

     while( scanf("%d",&T)!=EOF ){

         int Case = ;

         while( T-- ){

             scanf("%s",s1);

             scanf("%s",s2);

             init();

             int q;

             scanf("%d",&q);

             char a[],b[];

             while( q-- ){

                 scanf("%s",a);

                 scanf("%s",b);

                 ss[a[]-'a'][b[]-'a']=true;

                 //mp[ a[0] ] = b[0];

             }

             int len1 = strlen( s1 );

             int len2 = strlen( s2 );

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

                 dp[ i ][  ] = ;

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

                 dp[  ][ i ] = ;

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

                 for( int j=;j<=len2;j++ ){

                     if( same( i-,j- )==true )

                         dp[ i ][ j ] = dp[ i- ][ j- ]+;

                     else

                         dp[ i ][ j ] = max( dp[i-][j],dp[i][j-] );

                     //printf("dp[%d][%d]=%d\n",i,j,dp[i][j]);

                 }

             }

             if( dp[len1][len2]!=len1 ) printf("Case #%d: unhappy\n",Case++);

             else printf("Case #%d: happy\n",Case++);

         }

     }

     return ;

 }