1 #include<queue>
  2 #include<cstdio>
  3 #include<cstring>
  4 #include<algorithm>
  5 using namespace std;
  6 typedef long long lnt;
  7 struct pnt{
  8     int hd;
  9     int no;
 10     lnt dis;
 11     bool vis;
 12     bool friend operator < (pnt x,pnt y)
 13     {
 14         return x.dis>y.dis;
 15     }
 16 }p[500005];
 17 struct ent{
 18     int twd;
 19     int lst;
 20     lnt vls;
 21 }e[200005];
 22 int a,b,c,d,jdr;
 23 int n,m;
 24 int piq[10000];
 25 int cnt;
 26 lnt ans1,ans2,ans3;
 27 priority_queue<pnt>Q;
 28 void ade(int f,int t,lnt v)
 29 {
 30     cnt++;
 31     e[cnt].twd=t;
 32     e[cnt].vls=v;
 33     e[cnt].lst=p[f].hd;
 34     p[f].hd=cnt;
 35 }
 36 int main()
 37 {
 38     scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&jdr,&n);
 39     m=a+b+c+d+jdr;
 40     for(int i=1;i<=n;i++)
 41     {
 42         int l,r;
 43         scanf("%d%d",&l,&r);
 44         ade(l,r+1,(lnt)(r-l+1));
 45         ade(r+1,l,(lnt)(r-l+1));
 46     }
 47     for(int i=1;i<=m+1;i++)
 48     {
 49         p[i].dis=0x3f3f3f3f3f3f3f3fll;
 50         p[i].vis=0;
 51         p[i].no=i;
 52     }
 53     p[a+1].dis=0;
 54     Q.push(p[a+1]);
 55     while(!Q.empty())
 56     {
 57         int x=Q.top().no;
 58         Q.pop();
 59         if(p[x].vis)continue;
 60         p[x].vis=1;
 61         for(int i=p[x].hd;i;i=e[i].lst)
 62         {
 63             int to=e[i].twd;
 64             if(p[to].dis>p[x].dis+e[i].vls)
 65             {
 66                 p[to].dis=p[x].dis+e[i].vls;
 67                 Q.push(p[to]);
 68             }
 69         }
 70     }
 71     ans1+=(lnt)p[a+b+1].dis;
 72     ans2+=(lnt)p[a+b+c+1].dis;
 73     ans3+=(lnt)p[a+b+c+d+1].dis;
 74     for(int i=1;i<=m+1;i++)
 75     {
 76         p[i].dis=0x3f3f3f3f3f3f3f3fll;
 77         p[i].vis=0;
 78         p[i].no=i;
 79     }
 80     p[a+b+1].dis=0;
 81     Q.push(p[a+b+1]);
 82     while(!Q.empty())
 83     {
 84         int x=Q.top().no;
 85         Q.pop();
 86         if(p[x].vis)continue;
 87         p[x].vis=1;
 88         for(int i=p[x].hd;i;i=e[i].lst)
 89         {
 90             int to=e[i].twd;
 91             if(p[to].dis>p[x].dis+e[i].vls)
 92             {
 93                 p[to].dis=p[x].dis+e[i].vls;
 94                 Q.push(p[to]);
 95             }
 96         }
 97     }
 98     ans2+=(lnt)p[a+b+c+d+1].dis;
 99     ans3+=(lnt)p[a+b+c+1].dis;
100     for(int i=1;i<=m+1;i++)
101     {
102         p[i].dis=0x3f3f3f3f3f3f3f3fll;
103         p[i].vis=0;
104         p[i].no=i;
105     }
106     p[a+b+c+1].dis=0;
107     Q.push(p[a+b+c+1]);
108     while(!Q.empty())
109     {
110         int x=Q.top().no;
111         Q.pop();
112         if(p[x].vis)continue;
113         p[x].vis=1;
114         for(int i=p[x].hd;i;i=e[i].lst)
115         {
116             int to=e[i].twd;
117             if(p[to].dis>p[x].dis+e[i].vls)
118             {
119                 p[to].dis=p[x].dis+e[i].vls;
120                 Q.push(p[to]);
121             }
122         }
123     }
124     ans1+=(lnt)p[a+b+c+d+1].dis;
125     lnt ans=min(ans1,min(ans2,ans3));
126     if(ans>=0x3f3f3f3f3f3f3f3fll)
127         printf("-1\n");
128     else
129         printf("%lld\n",ans);
130     return 0;
131 }