#Java 7, 177 165 142 131 bytes

String c(){return"FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCGM".replace("_","         ").replace(""," ");}

-15 bytes thanks to @BassdropCumberwubwubwub.
-11 bytes thanks to @Numberknot.

Ungolfed & test code:

Try it here.

class M{
  static String c(){
    return "FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCGM"
      .replace("_","         ").replace(""," ");
  }

  public static void main(String[] a){
    System.out.print(c());
  }
}

Output:

F K C I I B A V W M G
N                   P
T                   N
C                   C
S                   P
P                   S
V                   C
S                   P
E                   L
S                   B
J C V C O R I B C M G

Java 7, 177 165 142 131 bytes

String c(){return"FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCGM".replace("_","         ").replace(""," ");}

-15 bytes thanks to @BassdropCumberwubwubwub.
-11 bytes thanks to @Numberknot.

Ungolfed & test code:

Try it here.

class M{
  static String c(){
    return "FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCGM"
      .replace("_","         ").replace(""," ");
  }

  public static void main(String[] a){
    System.out.print(c());
  }
}

Output:

F K C I I B A V W M G
N                   P
T                   N
C                   C
S                   P
P                   S
V                   C
S                   P
E                   L
S                   B
J C V C O R I B C M G

#Java 7, 177 165 142 bytes

String c(){String s="         ";return"FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCMG".replace("_",s).replace(""," ");}

-15 bytes thanks to @BassdropCumberwubwubwub.

If someone knows a shorter way then just hardcoded like this in Java let me know.. Usually these kind of kolmogorov-complexity-challenges need little to no golfing for the shortest answer in Java, unfortunately..
Ok, I have been able to golf it down by putting a space between every char after concatting. :)

Ungolfed & test code:

Try it here.

class M{
  static String c(){
    String s = "         ";
    return "FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCMG"
      .replace("_",s).replace(""," ");
  }

  public static void main(String[] a){
    System.out.print(c());
  }
}

Output:

F K C I I B A V W M G
N                   P
T                   N
C                   C
S                   P
P                   S
V                   C
S                   P
E                   L
S                   B
J C V C O R I B C M G

#Java 7, 177 165 142 131 bytes

String c(){return"FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCGM".replace("_","         ").replace(""," ");}

-15 bytes thanks to @BassdropCumberwubwubwub.
-11 bytes thanks to @Numberknot.

Ungolfed & test code:

Try it here.

class M{
  static String c(){
    return "FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCGM"
      .replace("_","         ").replace(""," ");
  }

  public static void main(String[] a){
    System.out.print(c());
  }
}

Output:

F K C I I B A V W M G
N                   P
T                   N
C                   C
S                   P
P                   S
V                   C
S                   P
E                   L
S                   B
J C V C O R I B C M G

#Java 7, 177 165 bytes

String c(){String s="         ";return("FKCIIBAVWMG\nN"+s+"P\nT"+s+"N\nC"+s+"C\nS"+s+"P\nP"+s+"S\nV"+s+"C\nS"+s+"P\nE"+s+"L\nS"+s+"B\nJCVCORIBCMG").replace(""," ");}

If someone knows a shorter way then just hardcoded like this in Java let me know.. Usually these kind of kolmogorov-complexity-challenges need little to no golfing for the shortest answer in Java, unfortunately..
Ok, I have been able to golf it down by putting a space between every char after concatting. :)

Ungolfed & test code:

Try it here.

class M{
  static String c(){
    String s = "         ";
    return ("FKCIIBAVWMG\nN"+s+"P\nT"+s+"N\nC"+s+"C\nS"+s+"P\nP"+s+"S\nV"+s+"C\nS"+s+"P\nE"+s+"L\nS"+s+"B\nJCVCORIBCMG")
        .replace("", " ");
  }

  public static void main(String[] a){
    System.out.print(c());
  }
}

Output:

F K C I I B A V W M G
N                   P
T                   N
C                   C
S                   P
P                   S
V                   C
S                   P
E                   L
S                   B
J C V C O R I B C M G

#Java 7, 177 165 142 bytes

String c(){String s="         ";return"FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCMG".replace("_",s).replace(""," ");}

-15 bytes thanks to @BassdropCumberwubwubwub.

If someone knows a shorter way then just hardcoded like this in Java let me know.. Usually these kind of kolmogorov-complexity-challenges need little to no golfing for the shortest answer in Java, unfortunately..
Ok, I have been able to golf it down by putting a space between every char after concatting. :)

Ungolfed & test code:

Try it here.

class M{
  static String c(){
    String s = "         ";
    return "FKCIIBAVWMG\nN_P\nT_N\nC_C\nS_P\nP_S\nV_C\nS_P\nE_L\nS_B\nJCVCORIBCMG"
      .replace("_",s).replace(""," ");
  }

  public static void main(String[] a){
    System.out.print(c());
  }
}

Output:

F K C I I B A V W M G
N                   P
T                   N
C                   C
S                   P
P                   S
V                   C
S                   P
E                   L
S                   B
J C V C O R I B C M G