#237 div2 C. Restore Graph

C. Restore Graph

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Valera had an undirected connected graph without self-loops and multiple edges consisting of n vertices. The graph had an interesting property: there were at most k edges adjacent to each of its vertices. For convenience, we will assume that the graph vertices were indexed by integers from 1 to n.

One day Valera counted the shortest distances from one of the graph vertices to all other ones and wrote them out in array d. Thus, element d[i] of the array shows the shortest distance from the vertex Valera chose to vertex number i.

Then something irreparable terrible happened. Valera lost the initial graph. However, he still has the array d. Help him restore the lost graph.

Input

The first line contains two space-separated integers n and k (1 ≤ k < n ≤ 10⁵). Number n shows the number of vertices in the original graph. Number k shows that at most k edges were adjacent to each vertex in the original graph.

The second line contains space-separated integers d[1], d[2], ..., d[n] (0 ≤ d[i] < n). Number d[i] shows the shortest distance from the vertex Valera chose to the vertex number i.

Output

If Valera made a mistake in his notes and the required graph doesn't exist, print in the first line number -1. Otherwise, in the first line print integer m (0 ≤ m ≤ 10⁶) — the number of edges in the found graph.

In each of the next m lines print two space-separated integers a_i and b_i (1 ≤ a_i, b_i ≤ n; a_i ≠ b_i), denoting the edge that connects vertices with numbers a_i and b_i. The graph shouldn't contain self-loops and multiple edges. If there are multiple possible answers, print any of them.

Sample test(s)

Input

3 2
0 1 1

Output

3
1 2
1 3
3 2

Input

4 2
2 0 1 3

Output

3
1 3
1 4
2 3

Input

3 1
0 0 0

Output

-1
 
#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int n,m;
vector<int>v[100010];
struct node{
   int a,b;
}ans[1000010];
int vis[100010];
int maxn;
bool deal()
{
    int len=0;
    if(v[0].size()!=1) return 1;
    if(v[1].size()>m) return 1;
    for(int i=1;i<=maxn;i++)
    {
        if(v[i].size()==0) return 1;
        int pre=0;
        for(int j=0;j<v[i].size();j++)
        {
           if(vis[v[i-1][pre]]==m) pre++;
           if(pre>=v[i-1].size()) return 1;
           vis[v[i-1][pre]]++;
           vis[v[i][j]]++;
           ans[len].a=v[i-1][pre];
           ans[len].b=v[i][j];
           len++;
        }
    }
    printf("%d\n",len);
    for(int i=0;i<len;i++)
        printf("%d %d\n",ans[i].a,ans[i].b);
    return 0;
}
int main()
{

    // freopen("in.in","r",stdin);
     while(~scanf("%d%d",&n,&m))
     {
         for(int i=0;i<=n;i++) v[i].clear();
         int dis;
         maxn=0;
         for(int i=1;i<=n;i++)
         {
             scanf("%d",&dis);
             maxn=max(maxn,dis);
             v[dis].push_back(i);
         }
         memset(vis,0,sizeof(vis));
         if(deal()) printf("-1\n");
     }
     return 0;
}