stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <iostream>



int main() {

 std:: string s;

 std::cin>>s;

 if (s.size()==19){

   

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



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

            s[i]=' ';

         }

      }



    }

    std::cout<<s;

 }

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



int main () {

	char str[25];

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

		

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

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

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

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

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

using namespace std;



int main() {

	string x;

	cin >> x;

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

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

				x[i] = ' ';

		}

	}

	cout << x;

}


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



int main () {

	char str[25];

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

		

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

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

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

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

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

using namespace std;



int main()

{

    string s; cin >> s;

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

    {

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

        {

            s[i] = ' ';

        }

    }

    std::cout << s << std::endl;

    return 0;

}


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



int main () {

	char str[25];

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

		

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

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

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

		}

		else{

			printf(" ", str[i]);

		}

			

		}

	puts("");

	return 0;

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

using namespace std;

#include <string>

#include <algorithm>

int main()

{

    char s[20];

    cin>>s;

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

    {

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

            s[i]=' ';

    }

    cout<<s;

}




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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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

using namespace std;

string s;

int main (){

    cin >> s;

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

        if(s[i]!=',') cout<<s[i];

        else cout<<' ';

    }

}


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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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

#include <string>

using namespace std;

string s;

int main(){

    cin>>s;

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

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

        else cout<<s[i];

    }

    return 0;

}

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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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

#include<bits/stdc++.h>



using namespace std;



int main()

{   string s;

    int i ;

    string news="";

    cin>>s;

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

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

            s[i]=' ';

            news=news+s[i];}

        else{

            news=news+s[i];

        }}

        cout<<news;





    return 0;

}


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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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



int main() {

 std:: string s;

 std::cin>>s;

 if (s.size()==19){

   

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



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

            s[i]=' ';

         }

      }



    }

    std::cout<<s;

 }

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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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

using namespace std;



int main() {

	string x;

	cin >> x;

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

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

				x[i] = ' ';

		}

	}

	cout << x;

}


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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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

using namespace std;



int main()

{

    string s; cin >> s;

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

    {

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

        {

            s[i] = ' ';

        }

    }

    std::cout << s << std::endl;

    return 0;

}


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

#include <string.h>



int main () {

	char ch[105];

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

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	

	return 0;

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

using namespace std;

#include <string>

#include <algorithm>

int main()

{

    char s[20];

    cin>>s;

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

    {

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

            s[i]=' ';

    }

    cout<<s;

}




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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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

using namespace std;

string s;

int main (){

    cin >> s;

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

        if(s[i]!=',') cout<<s[i];

        else cout<<' ';

    }

}


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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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

#include <string>

using namespace std;

string s;

int main(){

    cin>>s;

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

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

        else cout<<s[i];

    }

    return 0;

}

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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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

#include<bits/stdc++.h>



using namespace std;



int main()

{   string s;

    int i ;

    string news="";

    cin>>s;

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

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

            s[i]=' ';

            news=news+s[i];}

        else{

            news=news+s[i];

        }}

        cout<<news;





    return 0;

}


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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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



int main() {

 std:: string s;

 std::cin>>s;

 if (s.size()==19){

   

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



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

            s[i]=' ';

         }

      }



    }

    std::cout<<s;

 }

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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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

using namespace std;



int main() {

	string x;

	cin >> x;

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

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

				x[i] = ' ';

		}

	}

	cout << x;

}


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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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

using namespace std;



int main()

{

    string s; cin >> s;

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

    {

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

        {

            s[i] = ' ';

        }

    }

    std::cout << s << std::endl;

    return 0;

}


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

#include <string.h>

 

int main(){

	

char str[20];

    

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

    

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

	{

    	

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

      	printf(" ");

        }else{

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

        

      }

    }



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

using namespace std;

int main()

{

    string s;

    while(cin>>s)

    {

        int len=0;

        len=s.size();

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

        {

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

            {

                cout<<" ";

            }

            else

            {

                cout<<s[i];

            }

        }

        cout<<endl;

    }

   return  0;

}




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

#include <string.h>



int main (){

	char huruf1[1000];

	char huruf2[1000];

	char huruf3[1000];

	scanf ("%[^,],%[^,],%[^\n]", huruf1, huruf2, huruf3); getchar();

	printf ("%s %s %s\n",huruf1,huruf2,huruf3);

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

using namespace std;

int main()

{

    string s;

    while(cin>>s)

    {

        int len=0;

        len=s.size();

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

        {

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

            {

                cout<<" ";

            }

            else

            {

                cout<<s[i];

            }

        }

        cout<<endl;

    }

   return  0;

}




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

#include<string.h>

char x[105];

int main(){

	

	scanf("%s",x);

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

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

			printf(" ");

		else

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

	}

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

#include <bits/stdc++.h>

using namespace std;



int main()

{

    string s,c;

    cin>>s;

    char x=' ';

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

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

            c.push_back(x);

        }

        else{

            c.push_back(s[i]);

        }

    }

    cout<<c;

    return 0;

}


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

#include<string.h>

char x[105];

int main(){

	

	scanf("%s",x);

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

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

			printf(" ");

		else

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

	}

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



using namespace std;



int main()

{

   string s;

   cin>>s;

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

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

     s[i]=' ';

    }



   }

   cout<<s;





    return 0;

}




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

#include<string.h>

char x[105];

int main(){

	

	scanf("%s",x);

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

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

			printf(" ");

		else

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

	}

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

using namespace std;

int main()

{

    string s;

    while(cin>>s)

    {

        int len=0;

        len=s.size();

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

        {

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

            {

                cout<<" ";

            }

            else

            {

                cout<<s[i];

            }

        }

        cout<<endl;

    }

   return  0;

}




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



int main(){

	char s[22];

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

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

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

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

		} else{

			printf(" ");

		}

	}

	puts("");

	return 0;

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

#include <bits/stdc++.h>

using namespace std;



int main()

{

    string s,c;

    cin>>s;

    char x=' ';

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

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

            c.push_back(x);

        }

        else{

            c.push_back(s[i]);

        }

    }

    cout<<c;

    return 0;

}


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



int main(){

	char s[22];

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

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

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

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

		} else{

			printf(" ");

		}

	}

	puts("");

	return 0;

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



using namespace std;



int main()

{

   string s;

   cin>>s;

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

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

     s[i]=' ';

    }



   }

   cout<<s;





    return 0;

}




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



int main(){

	char s[22];

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

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

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

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

		} else{

			printf(" ");

		}

	}

	puts("");

	return 0;

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

using namespace std;

int main()

{

    string s;

    while(cin>>s)

    {

        int len=0;

        len=s.size();

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

        {

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

            {

                cout<<" ";

            }

            else

            {

                cout<<s[i];

            }

        }

        cout<<endl;

    }

   return  0;

}




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

 

int main(){

  char S[25];

  scanf("%s",S);



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

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

         printf(" ");

    }

    else{

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

       }

    }

  printf("\n");

  return 0;

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

#include <bits/stdc++.h>

using namespace std;



int main()

{

    string s,c;

    cin>>s;

    char x=' ';

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

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

            c.push_back(x);

        }

        else{

            c.push_back(s[i]);

        }

    }

    cout<<c;

    return 0;

}


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

 

int main(){

  char S[25];

  scanf("%s",S);



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

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

         printf(" ");

    }

    else{

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

       }

    }

  printf("\n");

  return 0;

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



using namespace std;



int main()

{

   string s;

   cin>>s;

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

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

     s[i]=' ';

    }



   }

   cout<<s;





    return 0;

}




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

 

int main(){

  char S[25];

  scanf("%s",S);



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

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

         printf(" ");

    }

    else{

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

       }

    }

  printf("\n");

  return 0;

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

using namespace std;

int main()

{

    string s;

    while(cin>>s)

    {

        int len=0;

        len=s.size();

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

        {

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

            {

                cout<<" ";

            }

            else

            {

                cout<<s[i];

            }

        }

        cout<<endl;

    }

   return  0;

}




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



int main()

{

    char ar[105];

    scanf("%s", ar);

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

    {

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

        {

            printf(" ");

        }

        else

        {

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

        }

    }

    puts("");

    return 0;

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

#include <bits/stdc++.h>

using namespace std;



int main()

{

    string s,c;

    cin>>s;

    char x=' ';

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

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

            c.push_back(x);

        }

        else{

            c.push_back(s[i]);

        }

    }

    cout<<c;

    return 0;

}


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



int main()

{

    char ar[105];

    scanf("%s", ar);

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

    {

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

        {

            printf(" ");

        }

        else

        {

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

        }

    }

    puts("");

    return 0;

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



using namespace std;



int main()

{

   string s;

   cin>>s;

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

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

     s[i]=' ';

    }



   }

   cout<<s;





    return 0;

}




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



int main()

{

    char ar[105];

    scanf("%s", ar);

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

    {

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

        {

            printf(" ");

        }

        else

        {

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

        }

    }

    puts("");

    return 0;

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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

#include <string.h>



int main() {

	char n[255];

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

	

	int len = strlen(n);

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	printf("\n");

	return 0;

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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

 

int main(){

    char s[25];

    scanf("%s", s);

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

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

            s[i] = ' ';

        }

    }

    printf("%s", s);

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

// Faster C++ solution for the same problem (measured speedup: 5.326226115767607x):
#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:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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

int main(){

	char s[25];

	

	scanf("%s",&s);

	

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

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

			printf(" ");

		}

		else {

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

		}

	}

	return 0;

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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



int main(){

	char s[105];

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

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

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

		printf(" ");

		}

		else{

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

		}

	}

	return 0;

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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



int main(){	

	char str[25];

	scanf("%s", str);

	

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

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

			printf(" ");

		} else {

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

		}

	}

	

	puts(" ");

	return 0;

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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

int main (){

	char str[19];

	scanf("%s", str);

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

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

			printf(" ");

		}

		else{

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

		}

	}



	return 0;

}
// Slower C++ solution:
// in the name of Allah ;

#include<bits/stdc++.h>

using namespace std ;

int main ()

{

	string s ;

	cin >> s ;

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

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

			cout << " " ;

		else

			cout << s[i] ;

	cout << endl;

}

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



int main()

{

    char arr[100];

    scanf("%s", arr);

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

    {

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

        {

            printf(" ");

        }

        else

        {

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

        }

    }

    printf("");

    return 0;

}