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

//using namespace atcoder;
//tabaicho  see https://boostjp.github.io/tips/multiprec-int.html   
// #include <boost/multiprecision/cpp_int.hpp>

// using namespace boost::multiprecision;

// cpp_int
// int128_t
// int256_t
// int512_t
// int1024_t

// uint128_t
// uint256_t
// uint512_t
// uint1024_t



#define int long long
 #define inf  1000000007
// #define inf  998244353

 #define pa pair<int,int>
 #define ll long long
 #define PI 3.14159265358979323846
 #define  mp make_pair
 #define  pb push_back
 #define EPS (1e-8)
 
      using namespace std;
                                          
 int dx[8]={0,1,0,-1,1,1,-1,-1};
 int dy[8]={1,0,-1,0,-1,1,1,-1};
                                            
class pa3{
	public:
	int x;
	int y,z;
	pa3(int x=0,int y=0,int z=0):x(x),y(y),z(z) {}
	bool operator < (const pa3 &p) const{
		if(x!=p.x) return x<p.x;
		if(y!=p.y) return y<p.y;
		 return z<p.z;
		//return x != p.x ? x<p.x: y<p.y;
	}
	bool operator > (const pa3 &p) const{
		if(x!=p.x) return x>p.x;
		if(y!=p.y) return y>p.y;
		 return z>p.z;
		//return x != p.x ? x<p.x: y<p.y;
	}
	bool operator == (const pa3 &p) const{
		return x==p.x && y==p.y && z==p.z;
	}
		bool operator != (const pa3 &p) const{
			return !( x==p.x && y==p.y && z==p.z);
	}

};

class pa4{
	public:
	int x;
	int y,z,w;
	pa4(int x=0,int y=0,int z=0,int w=0):x(x),y(y),z(z),w(w) {}
	bool operator < (const pa4 &p) const{
		if(x!=p.x) return x<p.x;
		if(y!=p.y) return y<p.y;
		if(z!=p.z)return z<p.z;
		return w<p.w;
		//return x != p.x ? x<p.x: y<p.y;
	}
	bool operator > (const pa4 &p) const{
		if(x!=p.x) return x>p.x;
		if(y!=p.y) return y>p.y;
		if(z!=p.z)return z>p.z;
		return w>p.w;
		//return x != p.x ? x<p.x: y<p.y;
	}
	bool operator == (const pa4 &p) const{
		return x==p.x && y==p.y && z==p.z &&w==p.w;
	}
		

};
class pa2{
	public:
	int x,y;
	pa2(int x=0,int y=0):x(x),y(y) {}
	pa2 operator + (pa2 p) {return pa2(x+p.x,y+p.y);}
	pa2 operator - (pa2 p) {return pa2(x-p.x,y-p.y);}
	bool operator < (const pa2 &p) const{
		return y != p.y ? y<p.y: x<p.x;
	}
	bool operator > (const pa2 &p) const{
		return x != p.x ? x<p.x: y<p.y;
	}
	bool operator == (const pa2 &p) const{
		return abs(x-p.x)==0 && abs(y-p.y)==0;
	}
	bool operator != (const pa2 &p) const{
		return !(abs(x-p.x)==0 && abs(y-p.y)==0);
	}
		

};



string itos( int i ) {
	ostringstream s ;
	s << i ;
	return s.str() ;
}
 
int Gcd(int v,int b){
	if(v==0) return b;
	if(b==0) return v;
	if(v>b) return Gcd(b,v);
	if(v==b) return b;
	if(b%v==0) return v;
	return Gcd(v,b%v);
}


 int mod;
int extgcd(int a, int b, int &x, int &y) {
    if (b == 0) {
        x = 1;
        y = 0;
        return a;
    }
    int d = extgcd(b, a%b, y, x);
    y -= a/b * x;
    return d;
}
pa operator+(const pa & l,const pa & r) {   
    return {l.first+r.first,l.second+r.second};                                    
}    
pa operator-(const pa & l,const pa & r) {   
    return {l.first-r.first,l.second-r.second};                                    
}  

ostream& operator<<(ostream& os, const vector<int>& VEC){
	for(auto v:VEC)os<<v<<" ";
    return os;
}

ostream& operator<<(ostream& os, const pa& PAI){
	os<<PAI.first<<" : "<<PAI.second;
    return os;
}

ostream& operator<<(ostream& os, const pa3& PAI){
	os<<PAI.x<<" : "<<PAI.y<<" : "<<PAI.z;
    return os;
}

ostream& operator<<(ostream& os, const pa4& PAI){
	os<<PAI.x<<" : "<<PAI.y<<" : "<<PAI.z<<" : "<<PAI.w;
    return os;
}

ostream& operator<<(ostream& os, const vector<pa>& VEC){
	for(auto v:VEC)os<<v<<" ";
    return os;
}


int beki(int wa,int rr,int warukazu){
	if(rr==0) return 1%warukazu;
	if(rr==1) return wa%warukazu;
	wa%=warukazu;
	if(rr%2==1) return ((ll)beki(wa,rr-1,warukazu)*(ll)wa)%warukazu;
	ll zx=beki(wa,rr/2,warukazu);
	return (zx*zx)%warukazu;
}

              
int pr[2100000];
int inv[2100000];



int comb(int nn,int rr){
	if(rr<0 || rr>nn || nn<0) return 0;
	int r=pr[nn]*inv[rr];
	r%=mod;
	r*=inv[nn-rr];
	r%=mod;
	return r;
}

void gya(int ert){
	pr[0]=1;
	for(int i=1;i<=ert;i++){
		pr[i]=((ll)pr[i-1]*i)%mod;
	}
		inv[ert]=beki(pr[ert],mod-2,mod);
	for(int i=ert-1;i>=0;i--){
		inv[i]=(ll)inv[i+1]*(i+1)%mod;
	}
}


                


                
              //   cin.tie(0);
    		//	ios::sync_with_stdio(false);
    			//priority_queue<pa3,vector<pa3>,greater<pa3>> pq;            
                 //sort(ve.begin(),ve.end(),greater<int>());
//    mt19937(clock_per_sec);
  //  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()) ;
struct unionfind{
	private:
	public:
	
vector<int> par,ranks,kosuu;
	
	void shoki(int N){
		par.resize(N+1,0);
		ranks.resize(N+1,0);
		kosuu.resize(N+1,1);
		for(int i=0;i<=N;i++){
			par[i]=i;
		}
	}

	int root(int x){
		return par[x]==x ? x : par[x]=root(par[x]);
	}

	bool same(int x,int y){
		return root(x)==root(y);
	}
	bool is_root(int x){
		return x==root(x);
	}
	void unite(int x,int y){
 		x=root(x);
	 	y=root(y);
		int xx=kosuu[x],yy=kosuu[y];
	 	if(x==y) return;
		if(ranks[x]<ranks[y]){
			par[x]=y;
			kosuu[y]=yy+xx;
		}
	 	else {
			par[y]=x;
			if(ranks[x]==ranks[y]) ranks[x]=ranks[x]+1;
	 		kosuu[x]=yy+xx;
	 	}
		return;
	}
};


int dp[55][150][52]={};

vector<vector<int>> G;
map<vector<int>,int>D;
int ok[150][150]={};
void ch(int x,int r,int c){
	//pa da=mp(-1,-1);
	
	vector<int>ve(c);
	for(int i=0;i<c;i++)if(r&(1<<i))ve[i]=1;
	int kado=0;
	
	for(int i=0;i<c-1;i++){
		int ko1=0,ko2=0;
		if(G[x][i])ko1++;
		if(ve[i])ko2++;
		if(G[x][i+1])ko2++;
		if(ve[i+1])ko1++;
		if(ko1+ko2==3||ko1+ko2==1)kado++;
		if(ko1==2&&ko2==0)return ;
		if(ko1==0&&ko2==2)return ;
		
	}
	if(G[x][0])if(ve[0]==0)kado++;
	if(G[x][0]==0)if(ve[0])kado++;
	if(G[x][c-1])if(ve[c-1]==0)kado++;
	if(G[x][c-1]==0)if(ve[c-1])kado++;
	
	
	
	unionfind uf;
	uf.shoki(20);
	
	for(int i=0;i<c-1;i++){
		if(G[x][i]>0&&G[x][i+1]>0)uf.unite(i,i+1);
		if(ve[i]>0&&ve[i+1]>0)uf.unite(6+i,6+i+1);
		
	}
	for(int i=0;i<c;i++){
		if(ve[i]>0&&G[x][i]>0)uf.unite(6+i,i);
	}
	
	for(int i=0;i<c;i++)if(G[x][i]>0)for(int j=i+1;j<c;j++)if(G[x][j]>0)if(G[x][i]==G[x][j]){
		bool bo=0;
		for(int k=i+1;k<j;k++)if(G[x][k]!=G[x][i]){
		bo=1;
			break;
		}
		if(bo&&uf.same(i,j))return ;
	}
	
	
	for(int i=0;i<c;i++)if(G[x][i]>0){
		uf.unite(13+G[x][i],i);
	}
	
	set<int>se;
	int ma=-1;
	for(auto v:G[x])ma=max(ma,v);
	for(int i=0;i<c;i++)for(int j=0;j<c;j++)if(G[x][i])if(ve[j])if(uf.same(i,j+6))se.insert(G[x][i]);
	if(x!=0&&r!=0&&(int)se.size()!=ma)return;
	

	
	for(auto &v:ve)v*=-1;
	int cnt=1;
	for(int i=0;i<c;i++)if(ve[i]<0){
		ve[i]=cnt;
		for(int j=i+1;j<c;j++)if(ve[j]<0){
			if(uf.same(6+i,6+j))ve[j]=cnt;
		}
		cnt++;
	}
	/*
	cout<<G[x]<<endl;
	cout<<ve<<endl;
	cout<<kado<<endl;
	cout<<endl;
	assert(D.count(ve));
	*/
	int id=D[ve];
	
	ok[x][id]=kado;
}

void solve(){
	int r,c,n;
	cin>>r>>c>>n;
	mod=998244353;
	for(int i=0;i<(1<<c);i++){
		vector<pa>ve;
		for(int j=0;j<c;j++)if(i&(1<<j)){
			if(ve.size()==0 || ve.back().second!=j-1)ve.pb(mp(j,j));
			else ve.back().second++;
		}
		if(i==0){
			G.pb(vector<int>(c,0));
		}
		else{
			if(ve.size()==1){
				vector<int>r(c,0);
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				G.pb(r);
				
			}
			if(ve.size()==2){
				vector<int>r(c,0);
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=1;
				
				G.pb(r);
				
				for(auto &v:r)v=0;
				
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=2;
				
				G.pb(r);
				
			
			}
			if(ve.size()==3){
				
				vector<int>r(c,0);
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=1;
				for(int j=ve[2].first;j<=ve[2].second;j++)r[j]=1;
				
				G.pb(r);
				
				for(auto &v:r)v=0;
				
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=1;
				for(int j=ve[2].first;j<=ve[2].second;j++)r[j]=2;
				
				G.pb(r);
				
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=2;
				for(int j=ve[2].first;j<=ve[2].second;j++)r[j]=2;
				
				G.pb(r);				
				
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=2;
				for(int j=ve[2].first;j<=ve[2].second;j++)r[j]=1;
				
				G.pb(r);	
				
				for(int j=ve[0].first;j<=ve[0].second;j++)r[j]=1;
				for(int j=ve[1].first;j<=ve[1].second;j++)r[j]=2;
				for(int j=ve[2].first;j<=ve[2].second;j++)r[j]=3;
				
				G.pb(r);	
				
			}
		}
		
		
	}	
	for(int i=0;i<(int)G.size();i++)D[G[i]]=i;
	//for(auto v:G)cout<<v<<endl;
	//cout<<G.size()<<endl;
	
	dp[0][0][0]=1;
int w=G.size();
	for(int i=0;i<127;i++)for(int j=0;j<127;j++)ok[i][j]=-1;
	for(int i=0;i<w;i++)for(int j=0;j<(1<<c);j++){
		ch(i,j,c);
	}
	
	vector<int>las;
	for(int i=0;i<w;i++){
		int d=-1;
		for(auto v:G[i])d=max(v,d);
		if(d==1){
			las.pb(i);
		//	cout<<"las "<<G[i]<<endl;
		}
	}
	
	
	int ans=0;
	for(int i=0;i<=r;i++){
		if(i==0){
			for(int j=1;j<w;j++)if(ok[0][j]>=0){
		//		cout<<G[j]<<endl;
		//		cout<<ok[0][j]<<endl;
				dp[i+1][j][ok[0][j]]++;
			}
		}
		else{
	//		cout<<"==="<<endl;
			for(int j=1;j<w;j++)for(int k=1;k<w;k++)if(ok[j][k]>=0){
				for(int l=0;l<=50;l++)if(dp[i][j][l]){
					
					if(l+ok[j][k]<=n){
						dp[i+1][k][l+ok[j][k]]+=dp[i][j][l];
						dp[i+1][k][l+ok[j][k]]%=mod;
						if(i==2&&G[k][0]==1&&G[k][1]==0&&G[k][2]==1){
	//						cout<<G[j]<<endl;
	//					cout<<G[k]<<endl;
	//					cout<<l+ok[j][k]<<" "<<dp[i+1][k][l+ok[j][k]]<<endl;
						}
					}
				}
			}
			for(auto j:las){
				for(int l=0;l<=50;l++)if(l+ok[j][0]==n)if(dp[i][j][l]){
	//				cout<<G[j]<<endl;
	//				cout<<dp[i][j][l]<<endl;
					ans+=dp[i][j][l]*(r+1-i)%mod;
				}
			}
			
		}
	}
	cout<<ans%mod<<endl;
}


signed main(){
	mod=inf;
	cin.tie(0);
	ios::sync_with_stdio(false);

int n=1;
//	cin>>n;
for(int i=0;i<n;i++)solve();
	return 0;

	
}