How do you distribute secret shares without knowing who to first distribute them to? Figure 1 on page 1249 of the “Multiparty Computation Secure Against
Continual Memory Leakage” paper shows $m$ committees are elected in step 1 and then later in step 3 are each given a secret share.  

But I was wondering if it is possible to pull out the election of $m$ committees from the pre-processing phase and do it in a different phase (like online phase)? The problem with the pre-processing phase is it is assumes no leakage so simplifying it is a step closer to completely getting rid of it.

I am essentially wondering if it is possible to distribute secret shares without knowing the committees (i.e. “don't run election protocol immediately, run it later”)?
As long as you know the reconstruction threshold a priori, I see no reason you can't generate a bunch of shares before knowing who you will distribute them to. Once you know who you are going to distribute them to, just send one share to each person.

On the other hand, if you don't know the reconstruction threshold, you wouldn't be able to construct, I don't see how you can do it. It would seem like an ill-posed problem at that point.