stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#pragma GCC optimize ("O3")

///#include<bits/stdc++.h>

#include<iostream>

#include<string>

using namespace std;







/// Info.

///****************************************************************************************************************************************///

/// Coder               : BAHAA El_DEEN OSAMA SAYED.

/// Problem name        : A - Haiku

/// Method              : IM-string

/// Date                : 23/2/2020

///****************************************************************************************************************************************///





#define rep0(i,x)         for(int i=0; i<=x ;++i)

#define all(v)           ((v.begin()),((v.end())

#define mm(v,d)          memset(v,d,sizeof(v))

#define lp(i,v)          for(int i=0;i<sizeof(v);++i)

#define lpi(i,j,n)       for(int i=(j);i>=(int)n;++i)

#define lpd(i,j,n)       for(int i=(j);i>=(int)n;--i)

#define MP               make_pair

#define SZ(v)            ((int) ( (v).size() ) )

#define ull              unsigned long long

#define ll               long long

#define pi               3.1415926536

#define oo               1e9

#define OO               1e18

#define Fx(n)            fixed<<setprecision(n)

#define FasterIO           std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define RE0              return 0

#define RE1              return 1

#define mp(a,b)          make_pair(a,b)

#define X                first

#define Y                second

#define pii              pair(int a, int b)

#define rep1(i,x)        for(int i=1;i<x;++i)

#define rep2(i,x)        for(int i=2;i<x;++i)

#define RE               return

//#define LD               long double

#define all(v) ((v).begin()),((v).end())





const  int  N   = (int) 1e5+100;

const  int  M   = (int) 1e4+4;

const  int  INF = (int) 0x3f3f3f3f;

///const double ESP = 1e-7;

///const ll MOD=1e8+9;





string str;



int main()

{

FasterIO;



cin>> str;

rep0(i,str.size())

{

    if(str[i]==',')

        str[i]= ' ' ;

}



cout << str;







 RE0;}


// Faster C++ solution for the same problem (measured speedup: 5.37612532081959x):
#include <stdio.h>  

#include <string.h>  

   

int main()  

{  

    char str[105];  

    scanf("%s",str);

    char ch = ' ';  

      

    

    for(int i = 0; i < strlen(str); i++){  

        if(str[i] == ',')  

            str[i] = ch;  

    }  

      

     

    printf("%s", str);  

          

    return 0;  

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std; 

int main()

{

string s;

cin>>s;



 for(int i=0;i<s.length();i++){

 	

 	if(s[i]==','){

 		cout<<" ";

	 }

	 else

	 cout<<s[i];

 }

}

// Faster C++ solution for the same problem (measured speedup: 5.349294192547493x):
#include <stdio.h>

#include <string.h>



int main(){

    char str[19];

    scanf("%[^\n]", str);

    for(int a = 0; a < 19; a++){

      if(str[a] == ','){

        printf(" ");

      } else{

        printf("%c", str[a]);

      }

    }



    return 0;

}
// Slower C++ solution:
#pragma GCC optimize ("O3")

///#include<bits/stdc++.h>

#include<iostream>

#include<string>

using namespace std;







/// Info.

///****************************************************************************************************************************************///

/// Coder               : BAHAA El_DEEN OSAMA SAYED.

/// Problem name        : A - Haiku

/// Method              : IM-string

/// Date                : 23/2/2020

///****************************************************************************************************************************************///





#define rep0(i,x)         for(int i=0; i<=x ;++i)

#define all(v)           ((v.begin()),((v.end())

#define mm(v,d)          memset(v,d,sizeof(v))

#define lp(i,v)          for(int i=0;i<sizeof(v);++i)

#define lpi(i,j,n)       for(int i=(j);i>=(int)n;++i)

#define lpd(i,j,n)       for(int i=(j);i>=(int)n;--i)

#define MP               make_pair

#define SZ(v)            ((int) ( (v).size() ) )

#define ull              unsigned long long

#define ll               long long

#define pi               3.1415926536

#define oo               1e9

#define OO               1e18

#define Fx(n)            fixed<<setprecision(n)

#define FasterIO           std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define RE0              return 0

#define RE1              return 1

#define mp(a,b)          make_pair(a,b)

#define X                first

#define Y                second

#define pii              pair(int a, int b)

#define rep1(i,x)        for(int i=1;i<x;++i)

#define rep2(i,x)        for(int i=2;i<x;++i)

#define RE               return

//#define LD               long double

#define all(v) ((v).begin()),((v).end())





const  int  N   = (int) 1e5+100;

const  int  M   = (int) 1e4+4;

const  int  INF = (int) 0x3f3f3f3f;

///const double ESP = 1e-7;

///const ll MOD=1e8+9;





string str;



int main()

{

FasterIO;



cin>> str;

rep0(i,str.size())

{

    if(str[i]==',')

        str[i]= ' ' ;

}



cout << str;







 RE0;}


// Faster C++ solution for the same problem (measured speedup: 5.375758413136105x):
#include <stdio.h>

#include <string.h>



int main(){

    char str[19];

    scanf("%[^\n]", str);

    for(int a = 0; a < 19; a++){

      if(str[a] == ','){

        printf(" ");

      } else{

        printf("%c", str[a]);

      }

    }



    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std; 

int main()

{

string s;

cin>>s;



 for(int i=0;i<s.length();i++){

 	

 	if(s[i]==','){

 		cout<<" ";

	 }

	 else

	 cout<<s[i];

 }

}

// Faster C++ solution for the same problem (measured speedup: 5.117579168710525x):
#include <stdio.h>



int main (){

	

	char s[25];

	scanf ("%[^\n]", &s);

	

	for (int i= 0; i < s[i]; i++  ) {

		if ( s[i] == ','){

			printf (" ");

		}

		else {

			printf ("%c", s[i]);

		}

	}

	

	

	puts ("");

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize ("O3")

///#include<bits/stdc++.h>

#include<iostream>

#include<string>

using namespace std;







/// Info.

///****************************************************************************************************************************************///

/// Coder               : BAHAA El_DEEN OSAMA SAYED.

/// Problem name        : A - Haiku

/// Method              : IM-string

/// Date                : 23/2/2020

///****************************************************************************************************************************************///





#define rep0(i,x)         for(int i=0; i<=x ;++i)

#define all(v)           ((v.begin()),((v.end())

#define mm(v,d)          memset(v,d,sizeof(v))

#define lp(i,v)          for(int i=0;i<sizeof(v);++i)

#define lpi(i,j,n)       for(int i=(j);i>=(int)n;++i)

#define lpd(i,j,n)       for(int i=(j);i>=(int)n;--i)

#define MP               make_pair

#define SZ(v)            ((int) ( (v).size() ) )

#define ull              unsigned long long

#define ll               long long

#define pi               3.1415926536

#define oo               1e9

#define OO               1e18

#define Fx(n)            fixed<<setprecision(n)

#define FasterIO           std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define RE0              return 0

#define RE1              return 1

#define mp(a,b)          make_pair(a,b)

#define X                first

#define Y                second

#define pii              pair(int a, int b)

#define rep1(i,x)        for(int i=1;i<x;++i)

#define rep2(i,x)        for(int i=2;i<x;++i)

#define RE               return

//#define LD               long double

#define all(v) ((v).begin()),((v).end())





const  int  N   = (int) 1e5+100;

const  int  M   = (int) 1e4+4;

const  int  INF = (int) 0x3f3f3f3f;

///const double ESP = 1e-7;

///const ll MOD=1e8+9;





string str;



int main()

{

FasterIO;



cin>> str;

rep0(i,str.size())

{

    if(str[i]==',')

        str[i]= ' ' ;

}



cout << str;







 RE0;}


// Faster C++ solution for the same problem (measured speedup: 5.142897040400798x):
#include <stdio.h>



int main (){

	

	char s[25];

	scanf ("%[^\n]", &s);

	

	for (int i= 0; i < s[i]; i++  ) {

		if ( s[i] == ','){

			printf (" ");

		}

		else {

			printf ("%c", s[i]);

		}

	}

	

	

	puts ("");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std; 

int main()

{

string s;

cin>>s;



 for(int i=0;i<s.length();i++){

 	

 	if(s[i]==','){

 		cout<<" ";

	 }

	 else

	 cout<<s[i];

 }

}

// Faster C++ solution for the same problem (measured speedup: 5.349294192547493x):
#include <stdio.h>



int main() {

	char str[19];

	scanf("%[^\n]", &str);

	for ( int a = 0; a < 19; a++){

		if(str[a] == ','){

			printf(" ");

		}

		else{

			printf("%c", str[a]);

		}

	}

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize ("O3")

///#include<bits/stdc++.h>

#include<iostream>

#include<string>

using namespace std;







/// Info.

///****************************************************************************************************************************************///

/// Coder               : BAHAA El_DEEN OSAMA SAYED.

/// Problem name        : A - Haiku

/// Method              : IM-string

/// Date                : 23/2/2020

///****************************************************************************************************************************************///





#define rep0(i,x)         for(int i=0; i<=x ;++i)

#define all(v)           ((v.begin()),((v.end())

#define mm(v,d)          memset(v,d,sizeof(v))

#define lp(i,v)          for(int i=0;i<sizeof(v);++i)

#define lpi(i,j,n)       for(int i=(j);i>=(int)n;++i)

#define lpd(i,j,n)       for(int i=(j);i>=(int)n;--i)

#define MP               make_pair

#define SZ(v)            ((int) ( (v).size() ) )

#define ull              unsigned long long

#define ll               long long

#define pi               3.1415926536

#define oo               1e9

#define OO               1e18

#define Fx(n)            fixed<<setprecision(n)

#define FasterIO           std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define RE0              return 0

#define RE1              return 1

#define mp(a,b)          make_pair(a,b)

#define X                first

#define Y                second

#define pii              pair(int a, int b)

#define rep1(i,x)        for(int i=1;i<x;++i)

#define rep2(i,x)        for(int i=2;i<x;++i)

#define RE               return

//#define LD               long double

#define all(v) ((v).begin()),((v).end())





const  int  N   = (int) 1e5+100;

const  int  M   = (int) 1e4+4;

const  int  INF = (int) 0x3f3f3f3f;

///const double ESP = 1e-7;

///const ll MOD=1e8+9;





string str;



int main()

{

FasterIO;



cin>> str;

rep0(i,str.size())

{

    if(str[i]==',')

        str[i]= ' ' ;

}



cout << str;







 RE0;}


// Faster C++ solution for the same problem (measured speedup: 5.375758413136105x):
#include <stdio.h>



int main() {

	char str[19];

	scanf("%[^\n]", &str);

	for ( int a = 0; a < 19; a++){

		if(str[a] == ','){

			printf(" ");

		}

		else{

			printf("%c", str[a]);

		}

	}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std; 

int main()

{

string s;

cin>>s;



 for(int i=0;i<s.length();i++){

 	

 	if(s[i]==','){

 		cout<<" ";

	 }

	 else

	 cout<<s[i];

 }

}

// Faster C++ solution for the same problem (measured speedup: 5.349294192547493x):
#include <stdio.h>

#include <string.h>



int main(){

	char kata[19];

	scanf("%[^\n]", &kata);

	

	for(int i=0; i<19;i++){

		if(kata[i]== ','){

			printf(" ");

		}

		else {

		

		printf("%c", kata[i]);

	}

}

	return 0;

}
// Slower C++ solution:
#pragma GCC optimize ("O3")

///#include<bits/stdc++.h>

#include<iostream>

#include<string>

using namespace std;







/// Info.

///****************************************************************************************************************************************///

/// Coder               : BAHAA El_DEEN OSAMA SAYED.

/// Problem name        : A - Haiku

/// Method              : IM-string

/// Date                : 23/2/2020

///****************************************************************************************************************************************///





#define rep0(i,x)         for(int i=0; i<=x ;++i)

#define all(v)           ((v.begin()),((v.end())

#define mm(v,d)          memset(v,d,sizeof(v))

#define lp(i,v)          for(int i=0;i<sizeof(v);++i)

#define lpi(i,j,n)       for(int i=(j);i>=(int)n;++i)

#define lpd(i,j,n)       for(int i=(j);i>=(int)n;--i)

#define MP               make_pair

#define SZ(v)            ((int) ( (v).size() ) )

#define ull              unsigned long long

#define ll               long long

#define pi               3.1415926536

#define oo               1e9

#define OO               1e18

#define Fx(n)            fixed<<setprecision(n)

#define FasterIO           std::ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)

#define RE0              return 0

#define RE1              return 1

#define mp(a,b)          make_pair(a,b)

#define X                first

#define Y                second

#define pii              pair(int a, int b)

#define rep1(i,x)        for(int i=1;i<x;++i)

#define rep2(i,x)        for(int i=2;i<x;++i)

#define RE               return

//#define LD               long double

#define all(v) ((v).begin()),((v).end())





const  int  N   = (int) 1e5+100;

const  int  M   = (int) 1e4+4;

const  int  INF = (int) 0x3f3f3f3f;

///const double ESP = 1e-7;

///const ll MOD=1e8+9;





string str;



int main()

{

FasterIO;



cin>> str;

rep0(i,str.size())

{

    if(str[i]==',')

        str[i]= ' ' ;

}



cout << str;







 RE0;}


// Faster C++ solution for the same problem (measured speedup: 5.375758413136105x):
#include <stdio.h>

#include <string.h>



int main(){

	char kata[19];

	scanf("%[^\n]", &kata);

	

	for(int i=0; i<19;i++){

		if(kata[i]== ','){

			printf(" ");

		}

		else {

		

		printf("%c", kata[i]);

	}

}

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    printf("%s\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.185186073658881x):
#include<cstdio>

int main()

{

	char A[100];

	while(scanf("%s",A)!=EOF){

		for(int i = 0; i < 19; i++){

			if(A[i]==',')	printf(" ");

			else	printf("%c",A[i]);

		}

		printf("\n");

		getchar();

	}

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.191371928222034x):
#include<cstdio>

int main()

{

	char A[100];

	while(scanf("%s",A)!=EOF){

		for(int i = 0; i < 19; i++){

			if(A[i]==',')	printf(" ");

			else	printf("%c",A[i]);

		}

		printf("\n");

		getchar();

	}

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    printf("%s\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.022334563054443x):
#include <stdio.h>

int main(){

	char kata [25];

	scanf ("%[^\n]", kata);

	for (int i= 0; kata[i]!='\0';i++){

		if (kata[i]!=','){

			printf ("%c", kata[i]);	

		}else{

			printf (" ");

		}

	}

puts("");

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.028326138040031x):
#include <stdio.h>

int main(){

	char kata [25];

	scanf ("%[^\n]", kata);

	for (int i= 0; kata[i]!='\0';i++){

		if (kata[i]!=','){

			printf ("%c", kata[i]);	

		}else{

			printf (" ");

		}

	}

puts("");

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.080215614937275x):
#include <stdio.h>

int main(){

	char kata [25];

	scanf ("%[^\n]", kata);

	for (int i= 0; kata[i]!='\0';i++){

		if (kata[i]!=','){

			printf ("%c", kata[i]);	

		}else{

			printf (" ");

		}

	}

puts("");

	return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.078429025802223x):
#include <stdio.h>

int main(){

	char kata [25];

	scanf ("%[^\n]", kata);

	for (int i= 0; kata[i]!='\0';i++){

		if (kata[i]!=','){

			printf ("%c", kata[i]);	

		}else{

			printf (" ");

		}

	}

puts("");

	return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    printf("%s\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.307435081577964x):
#include <stdio.h>



int main(){

    char arr[20];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == ',') arr[i] = ' ';

    puts (arr);

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.313766777500084x):
#include <stdio.h>



int main(){

    char arr[20];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == ',') arr[i] = ' ';

    puts (arr);

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.368601840077372x):
#include <stdio.h>



int main(){

    char arr[20];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == ',') arr[i] = ' ';

    puts (arr);

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.366713832472005x):
#include <stdio.h>



int main(){

    char arr[20];

    scanf ("%[^\n]", arr);

    for (int i = 0; arr[i] != '\0'; i++)

        if (arr[i] == ',') arr[i] = ' ';

    puts (arr);

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    printf("%s\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.236664488955275x):
#include <stdio.h>



int main() {

  char s[20];

  scanf("%[^\n]", s);



  for(int i = 0; s[i] != '\0'; i++) {

    if(s[i] == ',') {

      printf(" ");

      continue;

    }

    printf("%c", s[i]);

  }

  return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.242911756548866x):
#include <stdio.h>



int main() {

  char s[20];

  scanf("%[^\n]", s);



  for(int i = 0; s[i] != '\0'; i++) {

    if(s[i] == ',') {

      printf(" ");

      continue;

    }

    printf("%c", s[i]);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

 string S;

 cin>>S;

 char a=',';

for(int i=0;i<S.length();i++){

    if(S[i]==a){S[i]=' ';}

}

cout<<S;

 return 0;



}

// Faster C++ solution for the same problem (measured speedup: 5.297015635453541x):
#include <stdio.h>



int main() {

  char s[20];

  scanf("%[^\n]", s);



  for(int i = 0; s[i] != '\0'; i++) {

    if(s[i] == ',') {

      printf(" ");

      continue;

    }

    printf("%c", s[i]);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>



using namespace std;



int main()

{

    string s;

    int i=0;

    cin>>s;

    for(i=0;i<s.size();i++){

        if (s[i]==',')

            s[i]=' ' ;



    }

    cout<<s;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2951528029874x):
#include <stdio.h>



int main() {

  char s[20];

  scanf("%[^\n]", s);



  for(int i = 0; s[i] != '\0'; i++) {

    if(s[i] == ',') {

      printf(" ");

      continue;

    }

    printf("%c", s[i]);

  }

  return 0;

}
// Slower C++ solution:
#include <iostream>

#include <cstdio>

#include <string>

#include <cstring>

#include <stdlib.h>

#include <math.h>

#include <ctype.h>

#include <queue>

#include <map>

#include <set>

#include <string.h>

#include <algorithm>

using namespace std;



int main()

{

    char s[25];

   scanf("%s",s);

    for(int i=0;s[i]!='\0';++i)

    {

        if(s[i]==',')

            s[i]=' ';

    }

    printf("%s\n",s);

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.2619137459126595x):
#include <stdio.h>

#include <string.h>



int main () {

	char s[101];

	int i;

	scanf ("%[^\n]", s);

	int pnjg = strlen (s);

	for (int i = 0; i < pnjg ; i++) {

		if (s[i] == ',') {

			s[i] = ' ';

		}

	}

	printf ("%s", s);

	

	return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main()

{

    char s[30];

    scanf("%s",s);

    for(int i = 0; i < 19; i ++)

    {

        if(s[i] == ',')printf(" ");

        else printf("%c",s[i]);

    }

    printf("\n");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.268191135517137x):
#include <stdio.h>

#include <string.h>



int main () {

	char s[101];

	int i;

	scanf ("%[^\n]", s);

	int pnjg = strlen (s);

	for (int i = 0; i < pnjg ; i++) {

		if (s[i] == ',') {

			s[i] = ' ';

		}

	}

	printf ("%s", s);

	

	return 0;

}