Dice throw problem by recursion

#include<iostream>
using namespace std;

int FindWays(int n,int m,int sum){
  if(n==0 && sum!=0)
    return 0;
  if(n==0 && sum==0)
    return 1;
  if(sum<n)
    return 0;
  if(sum==n)
    return 1;
  int res=0;
  for(int i=1;i<=m;i++){
   res+=FindWays(n-1,m,sum-i);
   }
  return res;
  }

int main(){
   cout << FindWays(4, 2, 1) << endl;
    cout << FindWays(2, 2, 3) << endl;
    cout << FindWays(6, 3, 8) << endl;
    cout << FindWays(4, 2, 5) << endl;
    cout << FindWays(3,4, 5) << endl;
  return 0;
  }