import java.util.Scanner;
public class ZhenTi2 {
public static int[] data;
public static int kong;
public static int door0peo;
public static int door1peo;
public static int door2peo;
public static int chishu=0;
public static void dFS(int step,int count0,int count1,int count2,int count3,int endstep){
if(step==endstep) {
for(int i=0;i<endstep;i++) {
System.out.print(data[i]+" ");
}
System.out.println();
chishu++;
return;
}
if(count0<kong){
data[step]=0;
dFS(step+1,count0+1,count1,count2,count3,endstep);
}
if(count1<door0peo){
data[step]=1;
dFS(step+1,count0,count1+1,count2,count3,endstep);
}
if(count2<door1peo){
data[step]=2;
dFS(step+1,count0,count1,count2+1,count3,endstep);
}
if(count3<door2peo){
data[step]=3;
dFS(step+1,count0,count1,count2,count3+1,endstep);
}
}
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int spot=sc.nextInt();
data=new int[spot];
int door0=sc.nextInt();
door0peo=sc.nextInt();
int door1=sc.nextInt();
door1peo=sc.nextInt();
int door2=sc.nextInt();
door2peo=sc.nextInt();
kong=spot-door0peo-door1peo-door2peo;
dFS(0,0,0,0,0,spot);//dFS(int step,int count0,int count1,int count2,int count3,int endstep){
System.out.println(chishu);
}
}
public class ZhenTi2 {
public static int[] data;
public static int kong;
public static int door0peo;
public static int door1peo;
public static int door2peo;
public static int chishu=0;
public static void dFS(int step,int count0,int count1,int count2,int count3,int endstep){
if(step==endstep) {
for(int i=0;i<endstep;i++) {
System.out.print(data[i]+" ");
}
System.out.println();
chishu++;
return;
}
if(count0<kong){
data[step]=0;
dFS(step+1,count0+1,count1,count2,count3,endstep);
}
if(count1<door0peo){
data[step]=1;
dFS(step+1,count0,count1+1,count2,count3,endstep);
}
if(count2<door1peo){
data[step]=2;
dFS(step+1,count0,count1,count2+1,count3,endstep);
}
if(count3<door2peo){
data[step]=3;
dFS(step+1,count0,count1,count2,count3+1,endstep);
}
}
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
int spot=sc.nextInt();
data=new int[spot];
int door0=sc.nextInt();
door0peo=sc.nextInt();
int door1=sc.nextInt();
door1peo=sc.nextInt();
int door2=sc.nextInt();
door2peo=sc.nextInt();
kong=spot-door0peo-door1peo-door2peo;
dFS(0,0,0,0,0,spot);//dFS(int step,int count0,int count1,int count2,int count3,int endstep){
System.out.println(chishu);
}
}