In this paper, we will study the behavior of nonlocal boxes and non-signaling boxes by calculating a Bell Inequalities (BI) for all possible logical combinations of inputs and outputs. We have considered the case of equal number n of inputs and outputs, first for n = 2 using the CHSH BI and then generalized to the case n = 3 using the Svetlichny BI. n = 2 corresponds to 256 cases and increases exponentially for n = 3 (256x 256 = 65536 cases). We thus developped a computer program for processing the different cases by calculating the inequalities and also testing non-signaling in a systematic way. Maximal Bell parameter of 4 is obtained for the no-signaling family of 16 nonlocal boxes the PR Box being part of this family. Another family of 32 nonlocal boxes (green cases) is signaling and giving a BI violation 10/3 > 2sqrt(2)> 2, exceeding the quantum limit. The three-party correlation logical boxes give 65536 combinations of logical functions. Calculation (computer) of the Svetlichny leads to nonlocality for six different values.