Problem: It turns out that you are a great fan of rock band AC/PE. Peter learned that and started the following game: he plays the first song of the list of n songs of the group, and you have to find out the name of the song. After you tell the song name, Peter immediately plays the following song in order, and so on.

The i-th song of AC/PE has its recognizability pi. This means that if the song has not yet been recognized by you, you listen to it for exactly one more second and with probability of pi percent you recognize it and tell it's name. Otherwise you continue listening it. Note that you can only try to guess it only when it is integer number of seconds after the moment the song starts playing.

In all AC/PE songs the first words of chorus are the same as the title, so when you've heard the first ti seconds of i-th song and its chorus starts, you immediately guess its name for sure.

For example, in the song Highway To Red the chorus sounds pretty late, but the song has high recognizability. In the song Back In Blue, on the other hand, the words from the title sound close to the beginning of the song, but it's hard to name it before hearing those words. You can name both of these songs during a few more first seconds.

Determine the expected number songs of you will recognize if the game lasts for exactly T seconds (i. e. you can make the last guess on the second T, after that the game stops).

If all songs are recognized faster than in T seconds, the game stops after the last song is recognized.

Input

The first line of the input contains numbers n and T (1 ≤ n ≤ 5000, 1 ≤ T ≤ 5000), separated by a space. Next n lines contain pairs of numbers pi and ti (0 ≤ pi ≤ 100, 1 ≤ ti ≤ T). The songs are given in the same order as in Petya's list.

Output

Output a single number — the expected number of the number of songs you will recognize in T seconds. Your answer will be considered correct if its absolute or relative error does not exceed 10 - 6.

Examples

Input

2 2
50 2
10 1


Output

1.500000000


Input

2 2
0 2
100 2


Output

1.000000000


Input

3 3
50 3
50 2
25 2


Output

1.687500000


Input

2 2
0 2
0 2


Output

1.000000000

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;
import java.math.BigInteger;

public class Main{
    final boolean isFileIO =  false;
    BufferedReader in;
    PrintWriter out;
    StringTokenizer st = new StringTokenizer("");
    String delim = " ";

    public static void main(String[] args) throws IOException {
        Main m = new Main();
        m.initIO();
        m.solve();
        m.in.close();
        m.out.close();
    }

    public void initIO() throws IOException {
        if(!isFileIO) {
            in = new BufferedReader(new InputStreamReader(System.in));
            out = new PrintWriter(System.out);
        } else {
            in = new BufferedReader(new FileReader("input.txt"));
            out = new PrintWriter("output.txt"); 
        }
    }
  
    String nextToken() throws IOException {
        if(!st.hasMoreTokens()) {
            st = new StringTokenizer(in.readLine());
        }
        return st.nextToken(delim);
    }
 //
    String readLine() throws IOException {
        return in.readLine();
    }

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    public void solve() throws IOException {
        int n = nextInt(); int T = nextInt();
        double[] p = new double[n + 1];
        int[] t = new int[n + 1];
        for(int i = 0; i < n; i++) {
            p[i + 1] = nextInt() * 0.01;
            t[i + 1] = nextInt();
        }
        double[] curExact = new double[T + 1];
        double[] prevExact = new double[T + 1];
        double[] prevLess = new double[T + 1];
        double[] curLess = new double[T + 1];
        double[] other = new double[n + 1];
        double[] pow = new double[n + 1];
        for(int i = 1; i <= n; i++) {
            pow[i] = Math.pow(1 - p[i], t[i] - 1);
        }
        for(int i = 1; i <= T; i++) {
            if(i < t[1]) {
                prevExact[i] = curExact[i] = Math.pow(1 - p[1], i - 1) * p[1];
            }
            if(i == t[1]) {
                prevExact[i] = curExact[i] = Math.pow(1 - p[1], i - 1);
            }
        }
        for(int i = 2; i <= n; i++) {
            curExact[0] = 0;
            curLess[0] = 0;
            double q = 1 - p[i];
            for(int j = 1; j <= T; j++) {
                if(j - t[i] >= 0) {
                    curLess[j] = (curLess[j - 1] - prevExact[j - t[i]] * pow[i]) * q + prevExact[j];
                } else {
                    curLess[j] = curLess[j - 1] * q + prevExact[j];
                }
            }
            for(int j = 1; j <= T; j++) {
                if(j - t[i] >= 0) {
                    curExact[j] = (curLess[j - 1] - prevExact[j - t[i]] * pow[i]) * p[i] + prevExact[j - t[i]] * pow[i];
                } else {
                    curExact[j] = (curLess[j - 1]) * p[i];
                }

            }            

            for(int j = 0; j <= T; j++) {
                prevLess[j] = curLess[j];
                prevExact[j] = curExact[j];
            }
            other[i - 1] = curLess[T];
        }
        double ans = 0;
        for(int i = 0; i <= T; i++) {
            ans += n * curExact[i];
        }
        for(int i = 0; i < n; i++) {
            ans += i * other[i];
        }
        out.println(ans);
    }

}

class Utils {

    public static long binpow(long a, long exp, long mod) {
        if(exp == 0) {
            return 1;
        }
        if(exp % 2 == 0) {
            long temp = binpow(a, exp / 2, mod);
            return (temp * temp) % mod;
        } else {
            return (binpow(a, exp - 1, mod) * a) % mod;
        }
    }

    public static long inv(long a, long mod) {
        return binpow(a, mod - 2, mod);
    }

    public static long addmod(long a, long b, long mod) {
        return ((a + b) % mod + mod) % mod;
    }

    public static long gcd(long a, long b) {
        if(b == 0)
            return a;
        return gcd(b, a % b);
    }

    //mul must be < 10^18
    public static long mulmod(long a, long b, long mod) {
        return (a * b + (((a * b) / mod) + 1) * mod) % mod;
    }
}