#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <set>
#include <map>
#include <queue>
#include <tuple>
#include <unordered_set>
#include <unordered_map>
#include <functional>
#include <cstdio>
#include <cassert>
#define repeat(i,n) for (int i = 0; (i) < (n); ++(i))
#define repeat_from(i,m,n) for (int i = (m); (i) < (n); ++(i))
#define repeat_reverse(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define repeat_from_reverse(i,m,n) for (int i = (n)-1; (i) >= (m); --(i))
typedef long long ll;
using namespace std;
int main() {
    int n, l; cin >> n >> l;
    l *= 60;
    vector<int> s(n);
    repeat (i,n) {
        int mn, sc; char dummy; cin >> mn >> dummy >> sc;
        s[i] = mn * 60 + sc;
    }
    if (accumulate(s.begin(), s.end(), 0) <= l) {
        cout << n << endl;
        return 0;
    }
    vector<double> fact(n+1); fact[0] = 1; repeat (i,n) fact[i+1] = (i+1) * fact[i];
    double p = 0;
    repeat (h,n) {
        vector<vector<ll> > dp(n, vector<ll>(l));
        dp[0][0] = 1;
        repeat (i,n) if (i != h) {
            repeat_reverse (j,n-1) {
                repeat_reverse (k,max(0,l-s[i])) {
                    dp[j+1][k+s[i]] += dp[j][k];
                }
            }
        }
        repeat (j,n) {
            repeat_from (k,max(0,l-s[h]),l) {
                p += (j+1) * fact[j] * dp[j][k] * fact[n-j-1];
            }
        }
    }
    double q = fact[n];
    printf("%.12lf\n", p /(double) q);
    return 0;
}