Codeforces Round #203 (Div. 2) A. TL

A. TL

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Valera wanted to prepare a Codesecrof round. He's already got one problem and he wants to set a time limit (TL) on it.

Valera has written n correct solutions. For each correct solution, he knows its running time (in seconds). Valera has also wrote mwrong solutions and for each wrong solution he knows its running time (in seconds).

Let's suppose that Valera will set v seconds TL in the problem. Then we can say that a solution passes the system testing if its running time is at most v seconds. We can also say that a solution passes the system testing with some "extra" time if for its running time, a seconds, an inequality 2a ≤ v holds.

As a result, Valera decided to set v seconds TL, that the following conditions are met:

1. v is a positive integer;
2. all correct solutions pass the system testing;
3. at least one correct solution passes the system testing with some "extra" time;
4. all wrong solutions do not pass the system testing;
5. value v is minimum among all TLs, for which points 1, 2, 3, 4 hold.

Help Valera and find the most suitable TL or else state that such TL doesn't exist.

Input

The first line contains two integers n, m (1 ≤ n, m ≤ 100). The second line contains n space-separated positive integersa1, a2, ..., an (1 ≤ ai ≤ 100) — the running time of each of the n correct solutions in seconds. The third line contains m space-separated positive integers b1, b2, ..., bm (1 ≤ bi ≤ 100) — the running time of each of m wrong solutions in seconds.

Output

If there is a valid TL value, print it. Otherwise, print -1.

Sample test(s)

input

3 6
4 5 2
8 9 6 10 7 11

output

5

input

3 1
3 4 5
6

output

-1

#include <iostream>
#include <stdio.h>
#include <string.h>
using namespace std;
#define M 1000000
#define inf 100000
int main()
{
    int n,i,minx,a2,maxx,m,x;
    while(scanf("%d%d",&n,&m)!=EOF){
        minx=inf;maxx=inf;a2=-1;
        for(i=0;i<n;i++){
            scanf("%d",&x);
            minx=min(minx,x);
            a2=max(a2,x);
        }
        for(i=0;i<m;i++)
        {
            scanf("%d",&x);
            maxx=min(maxx,x);
        }
        if(minx*2>a2)
           a2=minx*2;
        if(a2>=maxx)
        printf("-1\n");
        else printf("%d\n",a2);
    }
    return 0;
}