You will choose m languages and write n programs in each language, each with length n*m. The kth program should output the kth character of each program, ordered by the program number.
For example, in this submission (for demonstration only; they can be any characters including newlines and tabs):
ABC DEF GHI
ABC should output
ADG, and programs
GHI should output
All programs in the list must not be a normal quine. So
ADG must be different. Same applies to the other two programs. Note that n*m must be at least 2 to make this possible.
You don't have to use your languages in specific order. So you can write two programs in language A, then three in language B, then another in language A again. But all languages must be used exactly the same number of times.
Leading / trailing newline in your program and output doesn't matter.
The answer with minimum n(m+10)/m3 wins. But I'll also award at least +100 bounty to the answer with most languages if it used at least 3 of them. Deadline for the bounty: after a week without improvement or Mar 1st, 2015 if no answer satisfied the criterion.
Rules about languages
You can use any languages with different names, or different versions which are generally considered different enough (such as Python 2/3, ECMAScript 5/6). But your programs must not output exactly the same thing in any other language you have used.