title: Generate all Combinations from Multiple (n) Lists
body: <p>EDIT: I am completely redoing my questions as I have figured out the simplest way of asking it.  Thanks to the commenters so far that got me thinking about the root problem.</p>
  
  <pre><code>public List&lt;string&gt; GetAllPossibleCombos(List&lt;List&lt;string&gt;&gt; strings)
  {
      List&lt;string&gt; PossibleCombos = new List&lt;string&gt;();
  
      //????
      {
          string combo = string.Empty;
          // ????
          {
              combo += ????
          }
          PossibleCombos.Add(combo);
      }
  
      return PossibleCombos;
  }
  </code></pre>
  
  <p>I need to figure out how to recursively go through each <code>List&lt;string&gt;</code> and combine 1 string from each list into a combo <code>string</code>. Don't worry too much about formatting the string as the "live" code uses a custom object instead. Also, feel free to assume that every list will contain at least 1 string and that there are no null values.</p>