/**

  * Note: The returned array must be malloced, assume caller calls free().

  */

 int* selfDividingNumbers(int left, int right, int* returnSize){

     int* a=calloc(right-left+,sizeof(int));

     int i=left;

     int t=;

     while(i<=right){

         if(i<){

             a[t++]=i;

         }else{

             int flag=;

             int x=i;

             while(x){

                 if(x%==){

                     flag=;

                     break;

                 }else if(i%(x%)!=){

                     flag=;

                     break;

                 }

                 x/=;

             }

             if(flag) a[t++]=i;

         }

         i++;

     }

     *returnSize=t;

     return a;

 }