codeforces Round #272(div2) D解题报告

D. 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 .

题目大意：

要求分出n个集合，每个集合4个数字（在输出里面提到，果然还是得看题仔细啊），每个集合的gcd=k。求出这4*n个数的最大数m。

解法：

因为只需要每个集合里面的gcd=k,所以我们只需要考虑4个数字的gcd就够了。然而gcd=k，可以化成 k*(gcd=1)。这样，我们首先就将集合的基本数认定为gcd=1。

如果n=1, k=1，那么答案应该是 1, 2, 3, 5； n = 1, k = 2, 答案应该是 2*1, 2*2, 2*3, 2*5。

如果n=2, k=1，那么答案应该是(1, 2, 3, 5) (7, 8, 9, 11)  推广一下就是 6*n+1, 6*n+2, 6*n+3, 6*n+5。

m= k*[6*(n-1)+5];

代码：

#include <cstdio>

int n, k, m;

void init() {
	scanf("%d%d", &n, &k);
}

void solve() {
	m=(6*(n-1)+5)*k;

	printf("%d\n", m);
	for (int i = 0; i < n; i++)
		printf("%d %d %d %d\n", k*(6*i+1), k*(6*i+2), k*(6*i+3), k*(6*i+5));
}

int main() {
	init();
	solve();
}