C (gcc), 179 bytes

-3 thanks to @vengy

Essentially a port of my JS answer.

n;y;d[]={15903,14343,12291,8193,8193,8583,390,0,0,0,0,2244,7374};main(x){for(;x=n%15,y=n/15,n++<195;)printf(x>13?"\n":"[4%cm ","6074"[d[y]>>x&1|(y>2&y<8)*7800/(~y&3?2:5)>>x&2]);}

Try it online!

Output

C (gcc), 151 bytes

-3 thanks to @vengy
-28 thanks to @ceilingcat

Essentially a port of my JS answer.

n;y;main(x){for(;n<195;printf(x>13?"\n":"[4%cm ","6074"[L"㸟㠇〃  ↇƆ\0\0\0\0ࣄ᳎"[y=n++/15]>>x&1|(y>2&y<8)*7800/(~y&3?2:5)>>x&2]))x=n%15;}

Try it online!

Output

C (gcc), 181 bytes

-3 thanks to @vengy

Essentially a port of my JS answer.

n;y;d[]={15903,14343,12291,8193,8193,8583,390,0,0,0,0,2244,7374};main(x){for(;x=n%15,y=n/15,n++<195;)printf(x>13?"\n":"[4%cm ","6074"[d[y]>>x&1|(y<3|y>7?0:7800/(~y&3?2:5)>>x&2)]);}

Try it online!

Output

C (gcc), 179 bytes

-3 thanks to @vengy

Essentially a port of my JS answer.

n;y;d[]={15903,14343,12291,8193,8193,8583,390,0,0,0,0,2244,7374};main(x){for(;x=n%15,y=n/15,n++<195;)printf(x>13?"\n":"[4%cm ","6074"[d[y]>>x&1|(y>2&y<8)*7800/(~y&3?2:5)>>x&2]);}

Try it online!

Output

C (gcc), 191 bytes

A quick and dirty port of my JS answer. Huge room for improvement.

x;y;d[]={15903,14343,12291,8193,8193,8583,390,0,0,0,0,2244,7374,5,2,2,2,5};main(n){for(n=0;x=n%15,y=n/15,n++<195;)printf(x>13?"\n":"[4%cm ","6074"[d[y]>>x&1|(y<3|y>7?0:7800/d[y+10]>>x&2)]);}

Try it online!

Output

C (gcc), 181 bytes

-3 thanks to @vengy

Essentially a port of my JS answer.

n;y;d[]={15903,14343,12291,8193,8193,8583,390,0,0,0,0,2244,7374};main(x){for(;x=n%15,y=n/15,n++<195;)printf(x>13?"\n":"[4%cm ","6074"[d[y]>>x&1|(y<3|y>7?0:7800/(~y&3?2:5)>>x&2)]);}

Try it online!

Output