Problem: We have a flat panel with two holes. Pins are nailed on its surface. From the back of the panel, a string comes out through one of the holes to the surface. The string is then laid on the surface in a form of a polygonal chain, and goes out to the panel's back through the other hole. Initially, the string does not touch any pins.

Figures F-1, F-2, and F-3 show three example layouts of holes, pins and strings. In each layout, white squares and circles denote holes and pins, respectively. A polygonal chain of solid segments denotes the string.

<image>
Figure F-1: An example layout of holes, pins and a string

<image>
Figure F-2: An example layout of holes, pins and a string

<image>
Figure F-3: An example layout of holes, pins and a string

When we tie a pair of equal weight stones to the both ends of the string, the stones slowly straighten the string until there is no loose part. The string eventually forms a different polygonal chain as it is obstructed by some of the pins. (There are also cases when the string is obstructed by no pins, though.)

The string does not hook itself while being straightened. A fully tightened string thus draws a polygonal chain on the surface of the panel, whose vertices are the positions of some pins with the end vertices at the two holes. The layouts in Figures F-1, F-2, and F-3 result in the respective polygonal chains in Figures F-4, F-5, and F-6. Write a program that calculates the length of the tightened polygonal chain.

<image>
Figure F-4: Tightened polygonal chains from the example in Figure F-1.

<image>
Figure F-5: Tightened polygonal chains from the example in Figure F-2.

<image>
Figure F-6: Tightened polygonal chains from the example in Figure F-3.

Note that the strings, pins and holes are thin enough so that you can ignore their diameters.

Input

The input consists of multiple datasets, followed by a line containing two zeros separated by a space. Each dataset gives the initial shape of the string (i.e., the positions of holes and vertices) and the positions of pins in the following format.

> m n
>  x1 y1
>  ...
>  xl yl
>

The first line has two integers m and n (2 ≤ m ≤ 100, 0 ≤ n ≤ 100), representing the number of vertices including two holes that give the initial string shape (m) and the number of pins (n). Each of the following l = m + n lines has two integers xi and yi (0 ≤ xi ≤ 1000, 0 ≤ yi ≤ 1000), representing a position Pi = (xi ,yi ) on the surface of the panel.

* Positions P1, ..., Pm give the initial shape of the string; i.e., the two holes are at P1 and Pm , and the string's shape is a polygonal chain whose vertices are Pi (i = 1, ..., m), in this order.
* Positions Pm+1, ..., Pm+n are the positions of the pins.


Note that no two points are at the same position. No three points are exactly on a straight line.

Output

For each dataset, the length of the part of the tightened string that remains on the surface of the panel should be output in a line. No extra characters should appear in the output.

No lengths in the output should have an error greater than 0.001.

Sample Input


6 16
5 4
11 988
474 975
459 16
985 12
984 982
242 227
140 266
45 410
92 570
237 644
370 567
406 424
336 290
756 220
634 251
511 404
575 554
726 643
868 571
907 403
845 283
10 4
261 196
943 289
859 925
56 822
112 383
514 0
1000 457
514 1000
0 485
233 224
710 242
850 654
485 915
140 663
26 5
0 953
180 0
299 501
37 301
325 124
162 507
84 140
913 409
635 157
645 555
894 229
598 223
783 514
765 137
599 445
695 126
859 462
599 312
838 167
708 563
565 258
945 283
251 454
125 111
28 469
1000 1000
185 319
717 296
9 315
372 249
203 528
15 15
200 247
859 597
340 134
967 247
421 623
1000 427
751 1000
102 737
448 0
978 510
556 907
0 582
627 201
697 963
616 608
345 819
810 809
437 706
702 695
448 474
605 474
329 355
691 350
816 231
313 216
864 360
772 278
756 747
529 639
513 525
0 0


Output for the Sample Input


2257.0518296609
3609.92159564177
2195.83727086364
3619.77160684813






Example

Input

6 16
5 4
11 988
474 975
459 16
985 12
984 982
242 227
140 266
45 410
92 570
237 644
370 567
406 424
336 290
756 220
634 251
511 404
575 554
726 643
868 571
907 403
845 283
10 4
261 196
943 289
859 925
56 822
112 383
514 0
1000 457
514 1000
0 485
233 224
710 242
850 654
485 915
140 663
26 5
0 953
180 0
299 501
37 301
325 124
162 507
84 140
913 409
635 157
645 555
894 229
598 223
783 514
765 137
599 445
695 126
859 462
599 312
838 167
708 563
565 258
945 283
251 454
125 111
28 469
1000 1000
185 319
717 296
9 315
372 249
203 528
15 15
200 247
859 597
340 134
967 247
421 623
1000 427
751 1000
102 737
448 0
978 510
556 907
0 582
627 201
697 963
616 608
345 819
810 809
437 706
702 695
448 474
605 474
329 355
691 350
816 231
313 216
864 360
772 278
756 747
529 639
513 525
0 0


Output

2257.0518296609
3609.92159564177
2195.83727086364
3619.77160684813

Solution (in CPP):

Solution:
#include <iostream>
#include <iomanip>
#include <complex>
#include <vector>
#include <algorithm>
#include <cmath>
#include <array>
using namespace std;
const double EPS = 1e-10;
const double INF = 1e12;
const double PI = acos(-1);
#define EQ(n,m) (abs((n)-(m)) < EPS)
#define X real()
#define Y imag()
typedef complex<double> P;
typedef vector<P> VP;
struct L : array<P, 2>{
    L(const P& a, const P& b){ at(0)=a; at(1)=b; }
    L(){}
};

namespace std{
    bool operator < (const P& a, const P& b){
        return !EQ(a.X,b.X) ? a.X<b.X : a.Y+EPS<b.Y;
    }
    bool operator == (const P& a, const P& b){
        return abs(a-b) < EPS;
    }
}

double dot(P a, P b){
    return (conj(a)*b).X;
}
double cross(P a, P b){
    return (conj(a)*b).Y;
}
int ccw(P a, P b, P c){
    b -= a;
    c -= a;
    if(cross(b,c) > EPS) return +1; //ccw
    if(cross(b,c) < -EPS) return -1; //cw
    if(dot(b,c) < -EPS) return +2; //c-a-b
    if(abs(c)-abs(b) > EPS) return -2; //a-b-c
    return 0; //a-c-b
}

bool intersectSS(const L& a, const L& b){
    return ( ccw(a[0],a[1],b[0]) *ccw(a[0],a[1],b[1]) <= 0 ) &&
        ( ccw(b[0],b[1],a[0]) *ccw(b[0],b[1],a[1]) <= 0 );
}

double shortest_path(P begin, P end, vector<L> &pl){
    pl.insert(pl.begin(), L(begin, begin));
    pl.push_back(L(end, end));
    int n = pl.size();
    vector<vector<double> > dp(n, vector<double>(2, INF));
    dp[0][0] = 0;
    for(int i=0; i<n; i++){
        for(int j=i+1; j<n; j++){
            for(int s=0; s<2; s++){
                for(int t=0; t<2; t++){
                    L edge(pl[i][s], pl[j][t]);
                    bool ok = true;
                    for(int k=i+1; k<j; k++){
                        if(!intersectSS(edge, pl[k])){
                            ok = false;
                            break;
                        }
                    }
                    if(ok){
                        dp[j][t] = min(dp[j][t], dp[i][s] +abs(edge[1] -edge[0]));
                    }
                }
            }
        }
    }
    return dp[n-1][0];
}

int main(){
    while(1){
        int m,n;
        cin >> m >> n;
        if(m == 0) break;

        VP p(m), pin(n);
        P rot(cos(0.01), sin(0.01));
        for(int i=0; i<m; i++){
            double x,y;
            cin >> x >> y;
            p[i] = P(x, y)*rot;
        }
        for(int i=0; i<n; i++){
            double x,y;
            cin >> x >> y;
            pin[i] = P(x, y)*rot;
        }

        sort(pin.begin(), pin.end());
        vector<L> ls;
        for(int i=0; i<n; i++){
            ls.emplace_back(P(pin[i].X, -1e4), pin[i]);
            ls.emplace_back(pin[i], P(pin[i].X, 1e4));
        }

        vector<int> pass;
        for(int i=0; i<m-1; i++){
            L line(p[i], p[i+1]);
            if(EQ(line[0].X, line[1].X)) continue;
            bool goR = line[0].X < line[1].X;
            int j = goR? 0: ls.size()-1;
            while((goR && j<(int)ls.size()) || (!goR && j>=0)){
                if(intersectSS(ls[j], line)){
                    if(pass.empty() || pass.back() != j){
                        pass.push_back(j);
                    }else{
                        pass.pop_back();
                    }
                }
                if(goR) j++;
                else j--;
            }
        }

        double ans = 0;
        P start = p[0];
        vector<L> pl;
        for(int i=0; i<(int)pass.size(); i++){
            if(i!=(int)pass.size()-1 && EQ(ls[pass[i]][0].X, ls[pass[i+1]][0].X)){
                P end;
                if(ls[pass[i]][0].Y < ls[pass[i+1]][0].Y){
                    end = ls[pass[i]][1];
                }else{
                    end = ls[pass[i]][0];
                }
                ans += shortest_path(start, end, pl);
                start = end;
                pl = vector<L>();
            }else{
                pl.push_back(ls[pass[i]]);
            }
            if(i == (int)pass.size()-1){
                ans += shortest_path(start, p[m-1], pl);
            }
        }
        cout << fixed << setprecision(4);
        cout << ans << endl;
    }
    return 0;
}