Problem: Dreamoon likes to play with sets, integers and <image>. <image> 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 from S, <image>.

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.

Examples

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

Solution (in JAVA):

Solution:
/*
@@@@@@@@@@@@@@@@@@@@@@@@
@@@@@@@@@@@@@@@@@@@@@@@@
@@@ Akhmedov Doston  @@@
@@@@@@@@@@@@@@@@@@@@@@@@
  @@              @@
  
*/

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Locale;
import java.util.StringTokenizer;

public class r_272_d {
	static BufferedReader br;
	static PrintWriter pw;
	static StringTokenizer st;
	public static void main(String[] args)throws IOException {
		Locale.setDefault(Locale.US);
		br=new BufferedReader(new InputStreamReader(System.in));
		pw=new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		
		//gfile();
		int n=nextInt(),k=nextInt();
		int x[][]=new int[n+1][5];
		x[1][1]=k;
		x[1][2]=2*k;
		x[1][3]=3*k;
		x[1][4]=5*k;
		int w=7,m=5*k;
		for (int i = 2; i <=n; i++) {
			x[i][1]=k*w++;
			x[i][2]=k*w++;
			x[i][3]=k*w++;
			x[i][4]=k*++w;
			w+=2;
			m=x[i][4];
		}
		pw.println(m);
		for (int i = 1; i <=n; i++) {
			for (int j = 1; j <=4; j++) {
				pw.print(x[i][j]+" ");
			}
			pw.println();
		}
		pw.close();
	}
	private static void gfile() throws IOException{
		br=new BufferedReader(new FileReader(new File("input.txt")));
		pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	}
	private static long nextLong()throws IOException {
		return Long.parseLong(next());
	}
	private static double nextDouble()throws IOException {
		return Double.parseDouble(next());
	}
	private static int nextInt()throws IOException {
		return Integer.parseInt(next());
	}
	private static String next()throws IOException{
		while(st==null||!st.hasMoreTokens())
			st=new StringTokenizer(br.readLine());
		return st.nextToken();
	}
}