using namespace std; int n,m; int ans; void dfs(int x,int y) { if(x==n&&y==m) ans++; else { if(x[HTML_REMOVED]>n>>m; dfs(0,0); cout<<ans<<endl; return 0; }