#include <iostream>
#include <cstdio>
#include <cmath>
#include <map>
#include <algorithm>
#include <vector>
#include <cctype>
#include <queue>
using namespace std;
typedef long long ll;
const int maxn=500005;
const int INF=0x7f7f;

inline int read(){
    int x=0,w=1;char c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')w=-1;
    for(;isdigit(c);x=(x<<3)+(x<<1)+c-'0',c=getchar());
    return x*w;
}

inline ll readll(){
    ll x=0,w=1;char c=getchar();
    for(;!isdigit(c);c=getchar())if(c=='-')w=-1;
    for(;isdigit(c);x=(x<<3)+(x<<1)+c-'0',c=getchar());
    return x*w;
}

ll a[25];
map<ll,ll>mp;
int judge(int x){
	int p=0;
	while(x){
		if(x&1)p++;
		x>>=1;
	}
	if(p==6)return 1;
	else return 0;
}
int main(){
	ll n=read(),d=read();
	for(int i=0;i<8;i++){
		a[i]=d*((i&1)+(i&2)*pow(2,6)+(i&4)*pow(2,12));
		mp[a[i]]=1;
	}
	for(int k=8,b=2;k<=10;){
		for(int i=0;i<8;i++){
			a[k]=d*b*((i&1)+(i&2)*pow(2,6)+(i&4)*pow(2,12));
			if(!mp[a[k]])k++;
			mp[a[k]]=1;
		}
		b++;
	}
	for(int i=0;i<8;i++){
		a[i]=d*((i&1)+(i&2)*pow(2,6)+(i&4)*pow(2,12));
		mp[a[i]]=1;
	}
	for(int i=0,p=1;p<=n;i++){
		if(judge(i)){
			int x=i,c=0;
			while(x){
				if(x&1)printf("%d ",a[c]);
				x>>=1;c++;
			}
			p++;
			printf("\n");
		}
	}
	return 0;
}