D. Dreamoon and Sets（Codeforces Round #272)



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, sj fromS, .

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，k。要从1-m中找n个集合（不用所有数都选），每个集合有四个不同的数字，每个数字只能在一个集合。每个集合满足
集合中任意两个数字的gcd（最大公约数）为k。要让n个集合中最大的数字最小，并输出方案。

解题思路：找规律

当k==1的时候，要让集合中的每个数两两互质。

当k！=1的时候，将k==1的时候的方案的每个数乘以k。
所以只需解决k==1的情况。可以找到规律：1,2,3,5；7,8,9,11；13,14,15,17；19,20,21,23；25,26,27,29……

规律的具体实现见代码。

#include<stdio.h>  
int main(){  
   int n,k;  
   scanf("%d%d",&n,&k);  
   printf("%d\n",(6*n-1)*k);  
   int ans=-5;  
   for(int i=1;i<=n;i++){  
       ans+=6;  
       printf("%d %d %d %d\n",ans*k,(ans+1)*k,(ans+2)*k,(ans+4)*k);  
   }    
   return 0;  
}