import itertools





f=open('scrabs2.txt', 'r')       # Here we are loading the Dictionary


inmem=f.readlines()              # from a text file into memory.


f.close                          # And closing the file





wordsort=sorted(raw_input('> ').upper())   # Taking input, making it uppercase, and making it into an alphabetically sorted list





out_list = []


out_list_2 = []


for i in range(1, len(wordsort)+1):                    # this is using something called itertools to create a list


  out_list.extend(itertools.combinations(wordsort, i)) # of all possible combinations of the letters in the word.


 


out_list=[list(t) for t in out_list]                  





#The above and below lines are changing the data between a couple of formats, it's kind of redundant





for i in out_list:


  out_list_2.append(''.join(i))





full_list=[]


   


for line in inmem:                               #OK, so here is where I think the problem is


  currentstring=(line.upper()).rstrip()          #This loop is iterating loads of times


  currentsort=sorted(list(currentstring))        #Sorting each dictionary word into alphabetical order and


  currentsort=str(''.join(currentsort))          #Comparing it to each possible combination of the original word


  for i in out_list_2:


    if currentsort==i:


      full_list.append(currentstring)





full_list=list(set(full_list))                   #This bit's just sorting and displaying the final list,


full_list=sorted(full_list, key=len)             #It seems to take time though :s


full_list.reverse()





for i in full_list:


  print i