Convert Magic the Gathering colours to a Colour based deck name Magic the gathering has many unique names for colour combinations in decks, as an example when Blue and White appear together in a deck, the deck maye sometimes be named after the Ravnican Guild that features those colours, namely 'Azorius'. There are some exceptions, and oddities though.
Below is a list of colour letters (one of WUBRG) combinations, and a list of their corresponding example colour deckname part (the order of letters is not fixed for this challenge):
W: Monowhite/Mono-White
U: Monoblue/Mono-Blue
B: Monoblack/Mono-Black 
R: Monored/Mono-Red
G: Monogreen/Mono-Green
WU: Azorius
WB: Orzhov
WR: Boros
WG: Selesnya
UB: Dimir
UR: Izzet
UG: Simic
BR: Rakdos
BG: Golgari
RG: Gruul
GWU: Bant
WUB: Esper
UBR: Grixis
BRG: Jund
RGW: Naya
WBG: Abzan/Indatha/Necra
URW: Jeskai/Raka/Raugrin
BUG: Sultai/Ana/Bug/Zagoth
RWB: Mardu/Dega/Savai
URG: Temur/Ceta/Rug/Ketria
UBRG: Chaos/Glint/Glint-Eye/Non-White
BRGW: Aggression/Dune/Dune-Brood/Non-Blue
RGWU: Altruism/Ink/Ink-Treader/Non-Black
GWUB: Growth/Witch/Witch-Maw/Non-Red
WUBR: Artifice/Yore/Yore-Tiller/Non-Green
WUBRG: Domain/Five-Color
C: Colorless/Monobrown/Mono-Brown

The challenge is to take in any of the letter combination entries above as input, and then output only one of the listed names. As previously started, the order of letters is not important, so BWRG is the same as BRGW etc, and should output one of Aggression/Dune/Dune-Brood/Non-Blue.
Input and output should be case insensitive, so that it will accept either as input, but either case of output (or both!) is fine.
Nonsense input is allowed to error or give a nonsense output. e.g. inputting 'wubrger' can throw an error or output 'Mark Rosewater' (or any string, even valid output) for example.
05AB1E, 136 135 133 132 bytes
“ƒÏˆ¨†¾‡—„¸ ŽÌ“#'Î×ì.•вO₁ŸĀ0Ðëœ´0+Eм/#‰TôbHüÆΣÇÐζfβq₅([²åOÇηB₂È¥ƶ]9í$µÅ–tå(h0!Ãα9½êT₄Ì€+µxΩ;'Äçî9©ÙÝ“R_Ÿ U„δ
ÅíÂu•#5ǝ˜.•Iλβ•æé¦Il{kè

Outputs in full lowercase; uses the shortest outputs if multiple are allowed.
Try it online or verify all test cases (uses a random permutations for each test case input).
Explanation:

“ƒÏˆ¨†¾‡—„¸ ŽÌ“ # Push dictionary string &quot;black green red blue white  brown&quot;
 #              # Split it on spaces: [&quot;black&quot;,&quot;green&quot;,&quot;red&quot;,&quot;blue&quot;,&quot;white&quot;,&quot;&quot;,&quot;brown&quot;]
  'Î×ì         '# Prepend dictionary string &quot;mono&quot; to each string
.•вO₁ŸĀ0Ðëœ´0+Eм/#‰TôbHüÆΣÇÐζfβq₅([²åOÇηB₂È¥ƶ]9í$µÅ–tå(h0!Ãα9½êT₄Ì€+µxΩ;'Äçî9©ÙÝ“R_Ÿ U„δ\nÅíÂu•
                # Push compressed string &quot;golgari rakdos gruul dimir simic izzet orzhov selesnya boros azorius jund ana grixis rug abzan dega naya esper bant raka chaos dune witch yore ink domain&quot;
 #              # Split on spaces as well
  5ǝ            # Insert this list at 0-based index 5
    ˜           # And flatten the list to complete the list of deck-names
.•Iλβ•          # Push compressed string &quot;bgruw&quot;
      æ         # Pop and push all its permutations
       é        # Sort them by length: [&quot;&quot;,&quot;b&quot;,&quot;g&quot;,&quot;r&quot;,&quot;u&quot;,&quot;w&quot;,&quot;bg&quot;,&quot;br&quot;,&quot;gr&quot;,&quot;bu&quot;,&quot;gu&quot;,&quot;ru&quot;,&quot;bw&quot;,&quot;gw&quot;,&quot;rw&quot;,&quot;uw&quot;,&quot;bgr&quot;,&quot;bgu&quot;,&quot;bru&quot;,&quot;gru&quot;,&quot;bgw&quot;,&quot;brw&quot;,&quot;grw&quot;,&quot;buw&quot;,&quot;guw&quot;,&quot;ruw&quot;,&quot;bgru&quot;,&quot;bgrw&quot;,&quot;bguw&quot;,&quot;bruw&quot;,&quot;gruw&quot;,&quot;bgruw&quot;]
        ¦       # Remove the first empty string
I               # Push the input-string
 l              # Convert it to lowercase
  {             # Sort its characters
   k            # Get the index of this string in the list of permutations,
                # or -1 if it isn't present in the case of input &quot;c&quot;/&quot;C&quot;
    è           # And use that index to index into the list of deck-names
                # (0-based, where -1 will wrap around to the end)
                # (after which the result is output implicitly)

See this 05AB1E tip of mine (sections How to use the dictionary? and How to compress strings not part of the dictionary?) to understand how the compressed strings work.