Codeforces 476D. Dreamoon and Sets

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Dreamoon likes to play with sets, integers and .  is defined as the largest positive integer that divides both a and b.

Let S be a set of exactly four distinct integers greater than 0. Define S to be of rank k if and only if for all pairs of distinct elements si, sjfrom S, .

Given k and n, Dreamoon wants to make up n sets of rank k using integers from 1 to m such that no integer is used in two different sets (of course you can leave some integers without use). Calculate the minimum m that makes it possible and print one possible solution.

Input

The single line of the input contains two space separated integers n, k (1 ≤ n ≤ 10 000, 1 ≤ k ≤ 100).

Output

On the first line print a single integer — the minimal possible m.

On each of the next n lines print four space separated integers representing the i-th set.

Neither the order of the sets nor the order of integers within a set is important. If there are multiple possible solutions with minimal m, print any one of them.

Sample test(s)

input

1 1

output

5
1 2 3 5

input

2 2

output

22
2 4 6 22
14 18 10 16

Note

For the first example it's easy to see that set {1, 2, 3, 4} isn't a valid set of rank 1 since .

题解

四个数两两gcd为k，意味着四个数除以k后互质，也就是我们要将1~m中4个数一组分成n组（有些数可不选），要求m最小。

可以发现连续的三个一定互质，再在中间选一个偶数即可。

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<algorithm>
#define ll long long
using namespace std;
ll n,k,pri[10002][4];
void pre()
{
    pri[1][0]=1; pri[1][1]=2; pri[1][2]=3; pri[1][3]=5;
    ll i;
    for(i=2;i<=n;i++)
       {pri[i][0]=pri[i-1][3]+2; pri[i][1]=pri[i][0]+1;
        pri[i][2]=pri[i][1]+1; pri[i][3]=pri[i][2]+2;
       }
}
int main()
{
    scanf("%I64d%I64d",&n,&k);
    pre();
    printf("%I64d\n",pri[n][3]*k);
    ll i;
    for(i=1;i<=n;i++)
       printf("%I64d %I64d %I64d %I64d\n",pri[i][0]*k,pri[i][1]*k,pri[i][2]*k,pri[i][3]*k);
    return 0;
}