#include <iostream>
using namespace std;


typedef long long int ll ;
const int MAXN = 10000;
const int MOD =1000000007;

ll dp[MAXN+1][MAXN+1];
int main() {
	// your code goes here
	for(int i = 0 ; i< MAXN; i++){
		for(int j = 0 ; j<=MAXN;j++){
			if(i==j || j==0) dp[i][j] = 1;
			else if(i==0 || j>i) dp[i][j]=0;
			else {
				dp[i][j] = (dp[i-1][j] + dp[i-1][j-1]) % MOD;
			}
		}
		
	}
	cout<<dp[6][4]<<" "<<dp[6][2];
	return 0;
}