#include <bits/stdc++.h>
using namespace std;
double nxt(double size, double want, double div2){
    return (log2(size) - log2(want)) * (double)div2;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    //sort by t
    double s, t;int n; cin >> s  >> t >> n;
    pair<double, double> process[n];
    double mxblade = 0;
    for(int i = 0; i < n; i++){ //hour, blade size
        cin >> process[i].second >> process[i].first;
        mxblade = max(mxblade, process[i].second);
    }
    sort(process, process+n);
    int cur = n;
    bool can = true;
    if(mxblade < s){
       can = false;
    }

    double ret = 0;
        while (s > t  && can){
            while(cur > 0 && process[cur-1].second >= s)cur--;
            can = true;
            int goal = t;
            if(cur != 0)goal = process[cur-1].second;
            ret += nxt(s, goal, process[cur].first);
            s = goal;
        }
    
    if(can)cout << fixed << setprecision(10) << ret << "\n";
    else cout << -1 << "\n";
}