The Pyramid of Languages Write a code that runs or compiles in as many programming languages as possible and prints a newline separated list of names of previous and current programming languages.


Every used language must have 1 character longer name than previous; ex. C#, C++, Ruby, Jelly, Python...
Each language must output a list of language names separated with a newline, sorted by length.


Output must be a pyramid: The list can only contain used language names, that are shorter than the running script language name + the running script language's name.

Leading and trailing newlines are allowed.
Standard loopholes are forbidden.
It's not allowed to create custom programming languages just to increase the score.
Version numbers don't count in language name, but you can specify it in your post if there are any incompatible changes in new versions of the language.
You can decide if you want to use the shortcut for the language name or it's full name, but you can't submit both forms in one answer. You can use ex. either SPL or Shakespeare Programming Language.


Only letters, numbers, ASCII symbols and single spaces (not leading nor trailing) count in language name length.



Examples

Example outputs for C, C# and C++:

C

C


C#

C
C#


C++

C
C#
C++
10 languages C, rk, >&lt;>, Rail, Width, Gol>&lt;>, Fission, Cardinal, brainfuck, Befunge-98, 991 bytes

//Q rk:start print: "C^nrk" rk:end @,k*97C'a"rk"a"&gt;&lt;&gt;"a-1"Sail"a"Width"a"Gol&gt;&lt;&gt;"a"Fission"a"Cardinal"a"brainfuck"a"Befunge-98"
main(){puts("C");}
/*
$'main'
 \-[C\n\rk\n\&gt;&lt;&gt;\n\Rail]o

++++[++++&gt;---&lt;]&gt;.&gt;++++++++++.[-------&gt;+++&lt;]&gt;.-------.&gt;++++++++++.[-&gt;++++++&lt;]&gt;++.--.++.&gt;++++++++++.&gt;-[---&gt;+&lt;]&gt;---.[------&gt;+&lt;]&gt;--.++++++++.+++.&gt;++++++++++.[------&gt;+&lt;]&gt;.+++[-&gt;++++&lt;]&gt;+.-----.--[---&gt;+&lt;]&gt;--.------------.&gt;++++++++++.[-&gt;+++++++&lt;]&gt;+.[---&gt;+&lt;]&gt;++.---.--[-&gt;+++&lt;]&gt;.--.++.&gt;++++++++++.[-&gt;+++++++&lt;]&gt;.[--&gt;+++&lt;]&gt;.++++++++++..----------.++++++.-.&gt;++++++++++.+[-&gt;++++++&lt;]&gt;+.-[--&gt;+++&lt;]&gt;--.--[---&gt;+&lt;]&gt;---.--------------.+++++.+++++.-------------.+++++++++++.&gt;++++++++++.+[---&gt;++++&lt;]&gt;--.[---&gt;+&lt;]&gt;----.+++[-&gt;+++&lt;]&gt;++.++++++++.+++++.--------.-[---&gt;+&lt;]&gt;--.+[-&gt;+++&lt;]&gt;+.++++++++.
R"C"N"rk"N"&gt;&lt;&gt;"N'S_!"ail"N"Width"N"Gol&gt;&lt;&gt;"N"Fission"*
/"&gt;&lt;&gt;krC"oaoooaooooE ao'liaR&gt;'~ooooaoS"Width"aoS"Gol&gt;&lt;&gt;"; QQaAWAmcOAWAaicmaiWAAiwAOaOwWAAAOawmmFOcQww
 %"C"++++++++++,"rk","&gt;&lt;&gt;",=--t++,"ail"~,"Width","Gol&gt;&lt;&gt;","Fission","Cardinal"
 */


Try it online!

568 bytes of this is just the brainfuck code. The Befunge-98 program produces:

C
rk
&gt;&lt;&gt;
Rail
Width
Gol&gt;&lt;&gt;
Fission
Cardinal
brainfuck
Befunge-98