Problem: Training is indispensable for achieving good results at ICPC. Rabbit wants to win at ICPC, so he decided to practice today as well.

Today's training is to use the Amidakuji to improve luck by gaining the ability to read the future. Of course, not only relying on intuition, but also detailed probability calculation is indispensable.

The Amidakuji we consider this time consists of N vertical bars with a length of H + 1 cm. The rabbit looks at the top of the stick and chooses one of the N. At the bottom of the bar, "hit" is written only at the location of the Pth bar from the left. The Amidakuji contains several horizontal bars. Consider the following conditions regarding the arrangement of horizontal bars.

* Each horizontal bar is at a height of a centimeter from the top of the vertical bar, where a is an integer greater than or equal to 1 and less than or equal to H.
* Each horizontal bar connects only two adjacent vertical bars.
* There are no multiple horizontal bars at the same height.



The rabbit drew M horizontal bars to satisfy these conditions. Unfortunately, the rabbit has a good memory, so I remember all the hit positions and the positions of the horizontal bars, so I can't enjoy the Amidakuji. So I decided to have my friend's cat add more horizontal bars.

First, the rabbit chooses one of the N sticks, aiming for a hit. After that, the cat performs the following operations exactly K times.

* Randomly select one of the locations that meet the conditions specified above even if a horizontal bar is added. Here, it is assumed that every place is selected with equal probability. Add a horizontal bar at the selected location.



Then, it is determined whether the stick selected by the rabbit was a hit. The way to follow the bars is the same as the normal Amidakuji (every time you meet a horizontal bar, you move to the next vertical bar). Rabbits want to have a high probability of winning as much as possible.



Input


H N P M K
A1 B1
...
AM BM


In Ai, Bi (1 ≤ i ≤ M), the i-th horizontal bar drawn by the rabbit is at a height of Ai centimeters from the top of the vertical bar, and the second vertical bar from the left and Bi from the left. + An integer that represents connecting the first vertical bar.

2 ≤ H ≤ 500, 2 ≤ N ≤ 100, 1 ≤ P ≤ N, 1 ≤ M ≤ 100, 1 ≤ K ≤ 100, M + K ≤ H, 1 ≤ A1 <A2 <... <AM ≤ H, Satisfy 1 ≤ Bi ≤ N-1.

Output

Output the probability of winning in one line when the rabbit chooses a stick so that the probability of winning is maximized. Absolute errors of 10-6 or less are allowed.

Examples

Input

9 4 3 2 1
2 1
7 3


Output

0.571428571


Input

9 4 3 2 3
2 1
7 3


Output

0.375661376

Solution (in CPP):

Solution:
// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;

#define debug(...) fprintf(stderr, __VA_ARGS__)
#define int long long int
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
typedef pair<int, int> pii;
typedef long long ll;
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const ll INF = 1001001001001001LL;
const ll MOD = 1000000007LL;

double dpn[110][510], dpc[110][510];
int can[510][110][2], exist[510], cnt[510];
signed main() {
    int H, N, P, M, K;
    cin >> H >> N >> P >> M >> K; P--;
    for(int i=0; i<M; i++) {
        int a, b; cin >> a >> b;
        a = H - a;
        exist[a] = true;
        can[a][b-1][1] = can[a][b][0] = true;
    }
    cnt[0] = H - M;
    for(int i=0; i<H; i++) cnt[i+1] = cnt[i] - !exist[i];

    dpc[P][0] = 1.0;
    for(int i=0; i<H; i++) {
        for(int k=0; k<=K; k++) {
            for(int j=0; j<N; j++) {
                // その行にすでに横線があるか
                // K 本全て引き終わった場合
                if(exist[i] or k == K) {
                    if(can[i][j][0]) dpn[j-1][k] += dpc[j][k];
                    else if(can[i][j][1]) dpn[j+1][k] += dpc[j][k];
                    else dpn[j][k] += dpc[j][k];
                }
                else {
                    // 横線を引く場合
                    // まだなにも横線が引かれてない行は cnt[i] 行
                    // 今の行に引かれる確率は (K - k) / cnt[i];
                    double p = 1.0 * (K - k) / cnt[i];
                    double r = 1.0, q = 1.0 / (N - 1);
                    if(j > 0) dpn[j-1][k+1] += dpc[j][k] * p * q, r -= q;
                    if(j+1 < N) dpn[j+1][k+1] += dpc[j][k] * p * q, r -= q;
                    dpn[j][k+1] += dpc[j][k] * p * r;
                    dpn[j][k] += dpc[j][k] * (1 - p);
                }
            }
        }
        fill(dpc[0], dpc[110], 0);
        swap(dpc, dpn);
    }
    double ans = 0.0;
    for(int i=0; i<N; i++) ans = max(ans, dpc[i][K]);
    printf("%.12f\n", ans);
    return 0;
}