Reaction systems are well-known formal models of interactions between biochemical reactions. A reaction system is a finite set of triples (reactants, inhibitors, products) that represent chemical reactions, where the reactants, the inhibitors, and the products are objects corresponding to the chemicals. The reactions may facilitate or inhibit each other. A distributed reaction system consists of a finite set of reaction systems that interact with their environment (function in a given context). The environment is a finite set of reactants provided by a context automaton. In the preceding paper, we studied distributed reaction systems where in each step, the context automaton provided a separate set of reactants to the component reaction systems. We assigned languages to these distributed reaction systems and provided representations of some well-known language classes by these constructs. In this paper, the context is provided for the whole distributed reaction system and the component reaction systems distribute the context among each other in different ways (the same context is valid for each component, or the context is split among the components). As in the preceding paper, we assign languages to these new types of distributed reaction systems and provide representations of well-known language classes (the class of right-linear simple matrix languages, the recursively enumerable language class).