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

#include<cstdlib>

#define min(a,b) (a<b?a:b)

const int clz=998244353;

#define mod clz

long long matm(long long val,long long k){

	long long ret=1;

	while(k){

		if(k&1) ret=ret*val%mod;

		k>>=1; val=val*val%mod;

	}

	return ret;

}

int n,k;

long long pw[100005],pu[100005],inv[100005];

inline long long C(int n,int m){if(m<0||m>n) return 0;return (pu[n]*inv[m]%mod)*inv[n-m]%mod;}

long long getans(int val){

	if(val&1){

		long long ans=0;

		int gro=min(k-val/2,val/2);

		int p=k-gro*2;

		//if(p==0) exit(0);

		for(int i=(p==0)?1:0;i<=gro;i++) {ans+=(C(n+p-1,i+p-1)*pw[i]%mod)*C(gro,i)%mod; ans%=mod;}

		return ans;

	}

	else{

		long long ans=0;

		int gro=min(k-val/2+1,val/2);

		int p=k-gro*2+1;

		//if(p==0) exit(0);

		for(int i=(p==0)?1:0;i<gro;i++) {ans+=(C(n+p-1,i+p-1)*pw[i]%mod)*C(gro-1,i)%mod; ans%=mod;}

		for(int i=(p==0)?1:0;i<gro;i++) {ans+=(C(n+p-2,i+p-1)*pw[i]%mod)*C(gro-1,i)%mod; ans%=mod;}

		return ans;

	}

}

int main(){

	pu[0]=pw[0]=1;

	for(int i=1;i<=100000;i++) pu[i]=pu[i-1]*i%mod;

	for(int i=1;i<=100000;i++) pw[i]=pw[i-1]*2%mod;

	inv[100000]=matm(pu[100000],mod-2);

	for(int i=99999;i>=0;i--) inv[i]=inv[i+1]*(i+1)%mod;

	scanf("%d%d",&k,&n);

	for(int i=2;i<=2*k;i++) printf("%lld\n",getans(i));

	return 0;

}

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

using namespace std;



int main() {

	ios::sync_with_stdio(0);

	cin.tie(0); cout.tie(0);

	const int mod = 998244353;

	int k, n; cin >> k >> n;

	vector<int> p2(k + 1, 1);

	vector<int> ii(k + n + 1, 1);

	auto modExp = [&](int a, int n) {

		int b = 1;

		for (; n; n >>= 1, a = (long long)a * a % mod) if (n & 1) b = (long long)b * a % mod;

		return b;

	};

	for (int i = 1; i <= k + n; i++) {

		ii[i] = modExp(i, mod - 2);

	}

	for (int i = 1; i <= k; i++) {

		p2[i] = p2[i - 1] * 2 % mod;

	}

	vector<vector<int>> ft(2, vector<int>(k, 0));

	for (int t = 0; t <= k / 2; t++) {

		long long f = 0, f2 = 0;

		long long C = 1;

		int tt = n + k - 2 * t - 1, tt2 = n + k - 2 * t - 3;

		vector<int> cn(tt + 5, 0), cn2(tt2 + 5, 0);

		cn[0] = 1;

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

			cn[i + 1] = (long long)cn[i] * (tt - i) % mod * ii[i + 1] % mod;

		}

		cn2[0] = tt2 >= 0;

		if (tt2 >= 0)

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

			cn2[i + 1] = (long long)cn2[i] * (tt2 - i) % mod * ii[i + 1] % mod;

		}

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

			int cc1 = (n >= i ? cn[n - i] : 0), cc2 = (n >= i + 2 ? cn2[n - i - 2] : 0);

			f = (f + C * p2[i] % mod * cc1) % mod;

			f2 = (f2 + C * p2[i] % mod * (cc1 - cc2)) % mod;

			C = C * (t - i) % mod * ii[i + 1] % mod;

		}

		ft[0][t] = f;

		ft[1][t] = (f2 + mod) % mod;

	}

	for (int i = 2; i <= 2 * k; i++) {

		int c = 0;

		for (int j = 1; j <= k; j++) {

			if (i - j >= 1 && i - j <= k) c++;

		}

		cout << ft[c & 1][c / 2] << "\n";

	}

	return 0;

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

#define int long long

using namespace std;

int mod=998244353;



int binpow(int a, int b) 

{

	int ans=1, cac=a;

	while(b)

	{

		if(b%2==1)

		{

			ans=(ans*cac)%mod;

		}

		cac=(cac*cac)%mod;

		b/=2;

	}

	return ans;

}

int n,k;

int dp[2005][2005],h[2005][2005],dr[2005],gt[4005],inv[4005];

int lmao(int n,int m)

{

	if(n==0&&m==0) return 1;

	if(n<=0||m<0) return 0;

	return ((gt[n+m-1]*inv[m])%mod*inv[n-1])%mod;

}

int solve(int val)

{

	int ans=0;

	if(val&1)

	{

		for(int i=1; i<=k; i++) 

		{

			dr[i]=(dp[val/2][i]+dp[val/2][i-1])%mod;

		}

		dr[0]=1;

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

		{

			ans=(ans+lmao(n-val,k-i)*dr[i]%mod)%mod;

		}

	}

	else for(int i=0; i<=k; i++)

	{

		ans=(ans+lmao(n-val,k-i)*dp[val/2][i]%mod)%mod;

	}

	return ans;

}



signed main()

{

	gt[0]=1;

	for(int i=1;i<=4000;i++)

	{

		gt[i]=(gt[i-1]*i)%mod;

	}

	inv[4000]=binpow(gt[4000],mod-2);

	for(int i=3999;i>=0;i--) 

	{

		inv[i]=inv[i+1]*(i+1)%mod;

	}

	cin>>n>>k;

	dp[0][0]=1;

	for(int i=0;i<=k;i++) h[0][i]=1;

	for(int i=1;i<=n/2;i++)

	for(int j=0;j<=k;j++)

	{

		if(j>0) dp[i][j]=2*h[i-1][j-1]%mod;

		dp[i][j]=(dp[i][j]+dp[i-1][j])%mod;

		h[i][j]=(h[i][j-1]+dp[i][j])%mod;

	}

	for(int i=2;i<=2*n;i++)

	{

		int cac=i-1;

		if(cac>n)

		{

			cac=2*n-cac;

		}

		cout<<solve(cac)<<'\n';

	}

	return 0;

}

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

using namespace std;



int main() {

	ios::sync_with_stdio(0);

	cin.tie(0); cout.tie(0);

	const int mod = 998244353;

	int k, n; cin >> k >> n;

	vector<int> p2(k + 1, 1);

	vector<int> ii(k + n + 1, 1);

	auto modExp = [&](int a, int n) {

		int b = 1;

		for (; n; n >>= 1, a = (long long)a * a % mod) if (n & 1) b = (long long)b * a % mod;

		return b;

	};

	for (int i = 1; i <= k + n; i++) {

		ii[i] = modExp(i, mod - 2);

	}

	for (int i = 1; i <= k; i++) {

		p2[i] = p2[i - 1] * 2 % mod;

	}

	vector<vector<int>> ft(2, vector<int>(k, 0));

	for (int t = 0; t <= k / 2; t++) {

		long long f = 0, f2 = 0;

		long long C = 1;

		int tt = n + k - 2 * t - 1, tt2 = n + k - 2 * t - 3;

		vector<int> cn(tt + 5, 0), cn2(tt2 + 5, 0);

		cn[0] = 1;

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

			cn[i + 1] = (long long)cn[i] * (tt - i) % mod * ii[i + 1] % mod;

		}

		cn2[0] = tt2 >= 0;

		if (tt2 >= 0)

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

			cn2[i + 1] = (long long)cn2[i] * (tt2 - i) % mod * ii[i + 1] % mod;

		}

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

			int cc1 = (n >= i ? cn[n - i] : 0), cc2 = (n >= i + 2 ? cn2[n - i - 2] : 0);

			f = (f + C * p2[i] % mod * cc1) % mod;

			f2 = (f2 + C * p2[i] % mod * (cc1 - cc2)) % mod;

			C = C * (t - i) % mod * ii[i + 1] % mod;

		}

		ft[0][t] = f;

		ft[1][t] = (f2 + mod) % mod;

	}

	for (int i = 2; i <= 2 * k; i++) {

		int c = 0;

		for (int j = 1; j <= k; j++) {

			if (i - j >= 1 && i - j <= k) c++;

		}

		cout << ft[c & 1][c / 2] << "\n";

	}

	return 0;

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

using namespace std;

string s[2005];

int val[2005][2005];

int main()

{

	int n,m;

	cin>>n>>m;

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

		cin>>s[i];

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

	{

		int cur=0;

		for(int j=0;j<m;j++)

		{

			val[i][j]+=cur;

			if(s[i][j]=='.')

				cur++;

			else

				cur=0;

		}

		cur=0;

		for(int j=m-1;j>=0;j--)

		{

			val[i][j]+=cur;

			if(s[i][j]=='.')

				cur++;

			else

				cur=0;

		}

	}

	for(int j=0;j<m;j++)

	{

		int cur=0;

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

		{

			val[i][j]+=cur;

			if(s[i][j]=='.')

				cur++;

			else

				cur=0;

		}

		cur=0;

		for(int i=n-1;i>=0;i--)

		{

			val[i][j]+=cur;

			if(s[i][j]=='.')

				cur++;

			else

				cur=0;

		}

	}

	int ans=0;

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

	{

		for(int j=0;j<m;j++)

		{

			if(s[i][j]=='.')

				ans=max(ans,val[i][j]);

		}

	}

	cout<<ans+1<<"\n";

	return 0;

}




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



char g[2001][2001];

int n,m,maxc[2001][2001],maxr[2001][2001],lst=-1,res,max;



int main(){

	scanf("%d%d",&n,&m);

	for(int i=0;i<n;i++)scanf("%s",g[i]);

	for(int i=0;i<n;i++,lst=-1,res=0)for(int j=0;j<=m;j++)

		if(j==m||g[i][j]!='.'){

			for(int k=lst+1;k<j;k++)maxc[i][k]=res;

			res=0,lst=j;

		}

		else res++;

	lst=-1,res=0;

	for(int j=0;j<m;j++,lst=-1,res=0)for(int i=0;i<=n;i++)

		if(i==n||g[i][j]!='.'){

			for(int k=lst+1;k<i;k++)maxr[k][j]=res;

			res=0,lst=i;

		}

		else res++;

	for(int i=0;i<n;i++)for(int j=0;j<m;j++)if(maxc[i][j]+maxr[i][j]>max)max=maxc[i][j]+maxr[i][j];

	printf("%d\n",max-1);

	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main()

{

	char str[12];

	scanf("%s", str);

	

	str[3]='8';

	

	puts(str);

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main()

{

	char str[12];

	scanf("%s", str);

	

	str[3]='8';

	

	puts(str);

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main() {

	char s[11];

	scanf("%s", s);

	printf("2018/01/");

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

	printf("%c\n", s[9]);	

	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main() {

	char s[11];

	scanf("%s", s);

	printf("2018/01/");

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

	printf("%c\n", s[9]);	

	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main(){

  

	char arr[10];

	

	scanf("%s",arr);

	

	arr[0] = '2';

	arr[1] = '0';

	arr[2] = '1';

	arr[3] = '8';

	

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

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

	}

  

    return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main(){

  

	char arr[10];

	

	scanf("%s",arr);

	

	arr[0] = '2';

	arr[1] = '0';

	arr[2] = '1';

	arr[3] = '8';

	

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

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

	}

  

    return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main(){

	int date[11];

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

		scanf("%c", &date[i]);

	}

	

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

		date[3] = '8';

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

	}



	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main(){

	int date[11];

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

		scanf("%c", &date[i]);

	}

	

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

		date[3] = '8';

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

	}



	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main(){

	char str[15];

	scanf("%s", &str);

	str[3]='8';

	

	printf("%s", str);

	

	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main(){

	char str[15];

	scanf("%s", &str);

	str[3]='8';

	

	printf("%s", str);

	

	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main (){

	char tanggal[12];

	scanf("%s", tanggal);

	tanggal[3]='8';

	printf("%s", tanggal);

	

	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main (){

	char tanggal[12];

	scanf("%s", tanggal);

	tanggal[3]='8';

	printf("%s", tanggal);

	

	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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

 

int main() {

	char S[30];

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

	S[3] = '8';

	printf("%s", S);

	

	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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

 

int main() {

	char S[30];

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

	S[3] = '8';

	printf("%s", S);

	

	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main(){

	

	char date2[10];

	

	scanf("%s", &date2);

	date2[0] = '2';

	date2[1] = '0';

	date2[2] = '1';

	date2[3] = '8';

	

	printf("%s", date2);

	

	return 0;

	

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main(){

	

	char date2[10];

	

	scanf("%s", &date2);

	date2[0] = '2';

	date2[1] = '0';

	date2[2] = '1';

	date2[3] = '8';

	

	printf("%s", date2);

	

	return 0;

	

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main() {

	char year[12];

	

	scanf("%s", year);

	year[3] = '8';

	

	printf("%s", year);

	

	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main() {

	char year[12];

	

	scanf("%s", year);

	year[3] = '8';

	

	printf("%s", year);

	

	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main (){

    char all[20];

    scanf("%s", all);

    all[0] = '2';

    all[1] = '0';

    all[2] = '1';

    all[3] = '8';

    printf("%s", all);











    return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main (){

    char all[20];

    scanf("%s", all);

    all[0] = '2';

    all[1] = '0';

    all[2] = '1';

    all[3] = '8';

    printf("%s", all);











    return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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



int main(){

	char S[100];

	scanf("%s", &S);

	S[0] = '2';

	S[1] = '0';

	S[2] = '1';

	S[3] = '8';

	printf("%s", S);



	return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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



int main(){

	char S[100];

	scanf("%s", &S);

	S[0] = '2';

	S[1] = '0';

	S[2] = '1';

	S[3] = '8';

	printf("%s", S);



	return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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

int main() {

    char S[11];

    scanf("%s", S);

    S[3] = '8';

    printf("%s", S);

    return 0;

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

#include<string>



using namespace std;



int main()

{

string in;

cin>>in;

in[3] = '8';

cout<<in;

return 0;

}

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

int main() {

    char S[11];

    scanf("%s", S);

    S[3] = '8';

    printf("%s", S);

    return 0;

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

#include<vector>

#include<algorithm>

#include<string>

#include<stdio.h>

#include<math.h>



#define ELIF else if

#define FOR(iterator, limit, adder) for(int iterator=0; iterator<limit; iterator+=adder)

#define PI 3.1415926535897932384626433832795

#define PB push_back



typedef long int int32;

typedef unsigned long int uint32;

typedef long long int int64;

typedef unsigned long long int  uint64;

typedef long long ll;



using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    string s;



    cin>> s;

    s[3]= '8';

    cout<< s<< "\n";

}

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

int main()

{ 

    char b[20];

    scanf("%s", &b);

    b[3] = '8';

    printf("%s", b);

    

    return 0;

}