PROGRAMMING:Permutation and combination
Input any positive integer m, N, calculate permutation a (m, n), combination C (m, n) and output（ 0<=m<=n<2^32）
Don't tell me you can't count permutations and combinations.
A(m,n)=n!/( n-m)! B(m,n)=A(m,n)/m!
###Input format:
The input has one line, two positive integers with a space between them.
###Output format:
The output has one line, two integers, that is, the number of permutations and combinations, separated by spaces.
###Input example:
Here is a set of inputs. For example:
```in
4 4
```
###Output example:
```out
24 1
```
answer：If there is no answer, please comment
Don't tell me you can't count permutations and combinations.
A(m,n)=n!/( n-m)! B(m,n)=A(m,n)/m!
###Input format:
The input has one line, two positive integers with a space between them.
###Output format:
The output has one line, two integers, that is, the number of permutations and combinations, separated by spaces.
###Input example:
Here is a set of inputs. For example:
```in
4 4
```
###Output example:
```out
24 1
```
answer：If there is no answer, please comment