Ping histogram

Summarize the response times a status page recorded as a histogram.

The bucket edges are given in milliseconds in increasing order: e0 < e1 < ... < ek. They define k + 2 buckets, in this order:

• 0 up to e0, written "0-<e0 - 1>"
• e0 up to e1, written "<e0>-<e1 - 1>", and so on for every pair of neighbouring edges
• ek and above (the overflow bucket), written "<ek>+"

A bucket includes its lower edge and excludes its upper edge, so a 250 ms reading with an edge at 250 belongs to the bucket that starts at 250. If there are no edges at all, there is a single bucket "0+".

Each reading is a string: "<n>ms" is n milliseconds, "<n>s" is n whole seconds (1 s = 1000 ms), and "timeout" is a request that never answered. Timeouts are not part of any range: they are counted on a final line of their own.

Input: edges, a list of integers, and readings, a list of strings.

Output: a list of strings, one per bucket in the order above, each written "<label>: <count>", followed by the line "timeout: <count>". Print every bucket, including empty ones, and always print the timeout line, even when its count is 0.