class Confia {
		for ( i=1; i<=m; i){
			for (j=1; j<=n; j)
			f[j][i] = 1;
}
		for (i=1; i<=m; i) {
			for ( k=1; k<=n; k) {
				if(i==k)
					f[k][k] = f[k][k-1] + 1;
				if(k>i)
					f[i][k] = f[k][i-1] + f[k-i][i];
				else 
					f[i][k] = 0;
			}
		
		} 
		return f[n][m];
}