D-Jamie and Interesting Graph （CodeForces-916C）（构造）

Jamie has recently found undirected weighted graphs with the following properties very interesting:

• The graph is connected and contains exactly n vertices and m edges.
• All edge weights are integers and are in range [1, 109] inclusive.
• The length of shortest path from 1 to n is a prime number.
• The sum of edges' weights in the minimum spanning tree (MST) of the graph is a prime number.
• The graph contains no loops or multi-edges.

If you are not familiar with some terms from the statement you can find definitions of them in notes section.

Help Jamie construct any graph with given number of vertices and edges that is interesting!

Input

First line of input contains 2 integers n, m  — the required number of vertices and edges.

Output

In the first line output 2 integers sp, mstw (1 ≤ sp, mstw ≤ 1014) — the length of the shortest path and the sum of edges' weights in the minimum spanning tree.

In the next m lines output the edges of the graph. In each line output 3 integers u, v, w (1 ≤ u, v ≤ n, 1 ≤ w ≤ 109) describing the edge connecting u and v and having weight w.

Examples

Input

4 4

Output

7 7
1 2 3
2 3 2
3 4 2
2 4 4

Input

5 4

Output

7 13
1 2 2
1 3 4
1 4 3
4 5 4

Note

The graph of sample 1:  Shortest path sequence: {1, 2, 3, 4}. MST edges are marked with an asterisk (*).

Definition of terms used in the problem statement:

A shortest path in an undirected graph is a sequence of vertices (v1, v2, ... , vk) such that vi is adjacent to vi + 1 1 ≤ i < k and the sum of weight  is minimized where w(i, j) is the edge weight between i and j. (https://en.wikipedia.org/wiki/Shortest_path_problem)

A prime number is a natural number greater than 1 that has no positive divisors other than 1 and itself. (https://en.wikipedia.org/wiki/Prime_number)

A minimum spanning tree (MST) is a subset of the edges of a connected, edge-weighted undirected graph that connects all the vertices together, without any cycles and with the minimum possible total edge weight. (https://en.wikipedia.org/wiki/Minimum_spanning_tree)

https://en.wikipedia.org/wiki/Multiple_edges

题意：给出 n 个点, m 个点. 要求组成一个最小生成树权重之和及始点到终点的最短路权重之和都为质数的图. 输出为最短路权重之和, 最小生成树权重之和一行, 两个点和连接它们的边的权一行。

思路：这道题的话，我们可以先构造一条边，路径上包括了所有 n 个结点. 我们接下来找到大于 n 的某个质数, 直接令这条路径作为生成树和最短路, 其权重之和等于这个质数，这样的话，我们将前n-2条边设为1, 最后一条设为质数-n+2。然后剩下的m-（n-1）条边统一分配1000000的权值。不知道因为这个质数的范围是怎么判定的......连wa9发，最后把priime=100010改成100003就AC了？？？！！（我傻逼了，prime是一个质数）≥﹏≤​​​​​​​

AC代码：

#include <stdio.h>
#include <string>
#include <string.h>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <queue>
#include <stack>
#include <map>
#include <set>
typedef long long ll;
const int maxx=100003;
const int inf=0x3f3f3f3f;
using namespace std;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    int prime=maxx;
    printf("%d %d\n",prime,prime);
    printf("1 2 %d\n",prime-n+2);
    for(int i=2; i<n; i++)
        printf("%d %d 1\n",i,i+1);
    int ans=m-(n-1);
    for(int i=1; i<=n-1; i++)
    {
        for(int j=i+2; j<=n; j++)
        {
            if(!ans)
                return 0;
            printf("%d %d %d\n",i,j,1000000);
            ans--;
        }
    }
    return 0;
}