CodeForces 746G. New Roads

There are n cities in Berland, each of them has a unique id — an integer from 1 to n, the capital is the one with id 1. Now there is a serious problem in Berland with roads — there are no roads.

That is why there was a decision to build n - 1 roads so that there will be exactly one simple path between each pair of cities.

In the construction plan t integers a1, a2, ..., at were stated, where t equals to the distance from the capital to the most distant city, concerning new roads. ai equals the number of cities which should be at the distance i from the capital. The distance between two cities is the number of roads one has to pass on the way from one city to another.

Also, it was decided that among all the cities except the capital there should be exactly k cities with exactly one road going from each of them. Such cities are dead-ends and can't be economically attractive. In calculation of these cities the capital is not taken into consideration regardless of the number of roads from it.

Your task is to offer a plan of road's construction which satisfies all the described conditions or to inform that it is impossible.

Input

The first line contains three positive numbers n, t and k (2 ≤ n ≤ 2·105, 1 ≤ t, k < n) — the distance to the most distant city from the capital and the number of cities which should be dead-ends (the capital in this number is not taken into consideration).

The second line contains a sequence of t integers a1, a2, ..., at (1 ≤ ai < n), the i-th number is the number of cities which should be at the distance i from the capital. It is guaranteed that the sum of all the values ai equals n - 1.

Output

If it is impossible to built roads which satisfy all conditions, print -1.

Otherwise, in the first line print one integer n — the number of cities in Berland. In the each of the next n - 1 line print two integers — the ids of cities that are connected by a road. Each road should be printed exactly once. You can print the roads and the cities connected by a road in any order.

If there are multiple answers, print any of them. Remember that the capital has id 1.

Examples

input

7 3 3
2 3 1

output

7
1 3
2 1
2 6
2 4
7 4
3 5

input

14 5 6
4 4 2 2 1

output

14
3 1
1 4
11 6
1 2
10 13
6 10
10 12
14 12
8 4
5 1
3 7
2 6
5 9

input

3 1 1
2

output

-1

题意： 构造一棵n个节点的树 其中深度为i的有a[i]个节点 共有k个叶节点 求一个方案

首先我们钦定同一深度的点都指向同一个父亲 这样叶子节点最多

然后从下到上进行调整 用两个指针 如果一个指针指向了尽头就跳到上一层

然后输出即可

另外C和E都FST了好不爽啊 C的边界条件挂了好气啊

#include <bits/stdc++.h>

using namespace std;

const int maxn = 200020;

int cur, cnt, l[maxn], r[maxn], f[maxn], n, t, k, a[maxn];

int now, L[maxn];

int main()
{
	scanf( "%d%d%d", &n, &t, &k );
	l[ 0 ] = r[ 0 ] = 1;
	L[ 0 ] = 2;
	for( int i = 1 ; i <= t ; i++ )
	{
		scanf( "%d",&a[ i ] );
		l[ i ] = r[ i - 1 ] + 1;
		L[ i ] = l[ i ] + 1;
		r[ i ] = l[ i ] + a[ i ] - 1;
		for( int j = l[ i ] ; j <= r[ i ] ; j++ )
		{
			f[ j ] = l[ i - 1 ];
			if( j != l[ i ] || i == t ) cnt++ ;
		}
	}
	if( cnt < k ) return puts("-1"), 0;
	int ret = t, now = l[ ret ] + 1;
	while( cnt > k )
	{
		if( !ret ) return puts("-1"),0;
		if( L[ ret - 1 ] == r[ ret - 1 ] + 1 ) { now = l[ --ret ] + 1; continue; }
		if( now == r[ ret ] + 1 ) { now = l[ --ret ] + 1; continue; }
		f[ now ] = L[ ret - 1 ];
		cnt--;
		now++;
		L[ ret - 1 ]++;
	}
	printf("%d\n",n);
	for( int i = 2 ; i <= n ; i++ )
		printf( "%d %d\n",i,f[ i ] );
	return 0;
}