5 2 4
5 4 1 0 The graph in this input is as follows:  There are five pairs $(i,j) (1 \leq i < j \leq N)$ such that the shortest distance between Vertex $i$ and Vertex $j$ is $1$: $(1,2)\,,(2,3)\,,(2,4)\,,(3,4)\,,(4,5)$. There are four pairs $(i,j) (1 \leq i < j \leq N)$ such that the shortest distance between Vertex $i$ and Vertex $j$ is $2$: $(1,3)\,,(1,4)\,,(2,5)\,,(3,5)$. There is one pair $(i,j) (1 \leq i < j \leq N)$ such that the shortest distance between Vertex $i$ and Vertex $j$ is $3$: $(1,5)$. There are no pairs $(i,j) (1 \leq i < j \leq N)$ such that the shortest distance between Vertex $i$ and Vertex $j$ is $4$.
3 1 3
3 0 The graph in this input is as follows: 
7 3 7
7 8 4 2 0 0
10 4 8
10 12 10 8 4 1 0 0 0
{
"problem": {
"name": "Line++",
"description": {
"content": "We have an undirected graph $G$ with $N$ vertices numbered $1$ to $N$ and $N$ edges as follows: * For each $i=1,2,...,N-1$, there is an edge between Vertex $i$ and Vertex $i+1$. * There is an edg",
"description_type": "Markdown"
},
"platform": "AtCoder",
"limit": {
"time_limit": 2000,
"memory_limit": 262144
},
"difficulty": "None",
"is_remote": true,
"is_sync": true,
"sync_url": null,
"sign": "abc160_d"
},
"statements": [
{
"statement_type": "Markdown",
"content": "We have an undirected graph $G$ with $N$ vertices numbered $1$ to $N$ and $N$ edges as follows:\n\n* For each $i=1,2,...,N-1$, there is an edge between Vertex $i$ and Vertex $i+1$.\n* There is an edg...",
"is_translate": false,
"language": "English"
}
]
}