1 #include <stdio.h>
 2 #include <string.h>
 3 #include <algorithm>
 4 using namespace std;
 5 
 6 struct dic
 7 {
 8     int n ;
 9     char str[10]; 
10 };
11 dic num[110];
12 
13 bool cmp(char c, char b)
14 {
15     return c > b; 
16 }
17 
18 bool cpm(dic str, dic n)
19 {
20     return strcmp(str.str, n.str) < 0;
21 }
22 int main()
23 {
24     char ch[10];
25     char s[10];
26     char ac[110][10];
27     int i, j,total=0;
28     while(~scanf("%s",ch)&&strcmp(ch, "XXXXXX")!=0)
29     {
30         strcpy(num[total++].str, ch);
31         //i++;
32     }    
33     sort(num, num+total, cpm);
34     //printf("%d\n", total);
35     while(~scanf("%s",ch),strcmp(ch, "XXXXXX")!=0)
36     {
37         int flag=0 ,len;
38         int nel=strlen(ch);
39         sort(ch, ch+nel, cmp);
40         for(i=0; i<=total; i++)
41         {
42                strcpy(s, num[i].str);
43             len = strlen(s);
44             sort(s, s+len, cmp);
45             if(strcmp(s, ch) == 0)
46             {
47                 printf("%s\n", num[i].str);
48                 flag++;
49             }
50             //else
51             //printf("NOT A VALID WORD\n");
52         }
53         if(flag==0)
54         printf("NOT A VALID WORD\n");
55           /*else
56         {
57             sort(ac,ac+flag,cpm);
58             for(i=0; i<flag; i++)
59             printf("%s", ac[i]);
60         }*/
61         printf("******\n");
62     }
63     return 0;
64 }