// 計算楊暉三角形，無遞迴版本
import java.io.*;
public class n7
{
        public static void main(String args[]) throws Exception
        {  //程式進入點
           String getbr;
           int i,j;
	   int a,b;//a階到b階
	   int tmp;
	   int pad;
	   int cans;
	   BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
	   while(true)
	   {
		   System.out.println("請寫出a階到b階之楊暉三角塔：");
		   System.out.print("請輸入a ");
		   getbr = br.readLine();
		   if (getbr.equals("0"))
		   {
			   System.out.println("結束");
			   return;
		   }
		   a=Integer.parseInt(getbr);//取得A階
		   if (a>10 || a<0)
		   {
			   System.out.println("重新輸入");
			   continue;
		   }
		   System.out.print("請輸入b ");
		   getbr = br.readLine();
		   b=Integer.parseInt(getbr);//取得B階
		    if (b>10 || b<0)
		   {
			   System.out.println("重新輸入");
			   continue;
		   }
		   if (a>b)
		   {
			   tmp=a;
			   a=b;
			   b=tmp;
		   }
		   for (i=a;i<=b;i=i+1) //第幾階
		   {
			   pad=1;
			   System.out.print("1\t");
			   for (j=1;j<=i;j=j+1) //第i階第幾項
			   {
				   pad=pad*(i-j+1)/j;
				   System.out.print(pad+"\t");
			   }
			   System.out.println();
		   }
	   }
	}
}