Alice's school is planning to take some students from her class on a field trip. Alice is really excited about it. There are a total of S students in her class. But due to budget constraints, the school is planning to take only N students for the trip. These students will be picked randomly. And each student has equal chance of being picked.
Alice's friend circle has M students including her. Though she is excited about the field trip, she will enjoy it only if there are atleast K of her friends with her on the trip. She is wondering what are the chances of that happening. She needs your help. Tell her the probability that she will enjoy given that she goes on the trip.

-----Input:-----
First line of input contains a single integer T, the number of test cases.

Each test starts with a single line having 4 space separated integers, S, N, M and K.

-----Output:-----
For each test case, output a line containing the required probability. The answer will be accepted if the relative error is not more than 10-6.

-----Constraints:-----
1 ≤ T ≤ 100
1 ≤ S ≤ 1000
1 ≤ N ≤ S
1 ≤ M ≤ S
0 ≤ K < M

-----Example:-----Input:
3
10 10 5 3
10 4 6 4
3 2 2 1

Output:
1.000000
0.000000
0.500000

-----Explanation:-----Case #1:
Every student will be taken to the trip. So all her 4 friends will accompany her to the trip no matter what. 
Case #2:
Alice wants 4 out of her 5 friends to come along with her which isn't possible because the school is willing to pick only 4 students for the trip.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

ns = {"__name__": "__main__"}
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'def nCk(N, K):\n nn=N\n klim = min(K, N-K)+1\n res = 1\n #print " res = " + str(res)\n for kk in range(1, klim):\n  res *= nn\n  #print " res = " + str(res)\n  res /= kk\n  #print " res = " + str(res)\n  nn -= 1\n #print str(N) + " choose " + str(K) + " = " + str(res)\n return res\n\n\ndef doTest():\n CC = input()\n CCT = CC.split()\n S = int(CCT[0])\n N = int(CCT[1])\n M = int(CCT[2])\n K = int(CCT[3])\n #print "S=" + str(S) + " N = " + str(N) + " M = "  + str(M) + " K = " + str(K\xa0\xa0\xa0\xa0\xa0\xa0\xa0)\n den = nCk(S-1, N-1)\n #print "den = " + str(den)\n klim = min(M, N)\n num = 0\n for kk in range(K, klim):\n  if ((S-M) < (N-kk-1)):\n   continue\n  num += nCk(M-1, kk)*nCk(S-M, N-kk-1)\n\n #print "num = " + str(num)\n ans = num/float(den)\n print("%.9f" % ans)\n\n\n# MAIN\nT = int(input())\n#print "T = " + str(T)\nfor tt in range(0, T):\n doTest()\n\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

```

Measured memory_bytes: 13111