//Ttensor.cc
//ecna 2009
// problem F - Here's a Product Which Will make you Tensor

#include <iostream>
using namespace std;

int row, col;
int Total;
int M[500][500], A[500][500], B[500][500];

//for debugging
void printM(int r, int c){
   for(int i=0;i<r;i++){
    for(int j=0;j<c;j++)
      cout<<M[i][j]<<' ';
    cout<<endl;
   }
   cout<<endl;
}

// for debugging
void printA(int r, int c){
   for(int i=0;i<r;i++){
    for(int j=0;j<c;j++)
      cout<<A[i][j]<<' ';
    cout<<endl;
   }
   cout<<endl;
}

// for debugging
void printB(int r, int c){
   for(int i=0;i<r;i++){
    for(int j=0;j<c;j++)
      cout<<B[i][j]<<' ';
    cout<<endl;
   }
   cout<<endl;
}

int GCD(int a, int b){
  if(b==0) return a;
  return GCD(b, a % b);
}

int CountAmults(int R, int C){
  int ThisCount;
  int gcd = A[0][0];

  for(int r=0;r<R;r++)
   for(int c=0;c<C;c++)
    gcd = GCD(gcd,A[r][c]);
  
  if(gcd == 1) return 1;
  //coutn divisors of gcd
  ThisCount = 1;
  for(int i=gcd/2; i>=1;i--)
    if(gcd % i == 0) ThisCount++;
  return ThisCount;
}

//know r | row && c | col
int CountTensors(int r, int c){
  int gcd;
  bool  OK;

  // find B
  gcd = M[0][0];
  for(int R=0; R<r;R++)
   for(int C=0;C<c;C++)
     gcd = GCD(gcd,M[R][C]);

  //build B
  for(int R=0; R<r;R++)
   for(int C=0;C<c;C++)
     B[R][C] = M[R][C]/gcd;
 
  A[0][0] = gcd;
  //now fill in rest of A[][], if OK
  OK = true;
  for(int upperRow=0;upperRow<row;upperRow += r)
   for(int upperCol=0;upperCol<col;upperCol += c)
     if(upperRow>0 || upperCol>0){
       //see if mult of B
       for(int R=0;R<r; R++)
        for(int C=0;C<c;C++)
         //see if consistent  multiples
         if(M[upperRow+R][upperCol+C] % B[R][C] !=0
            || M[upperRow+R][upperCol+C]/B[R][C] != M[upperRow][upperCol]/B[0][0])
           return 0;
        //we're ok if we got here; make A[][] entry
        A[upperRow/r][upperCol/c] = M[upperRow][upperCol]/B[0][0];
     }
   //if we're here,, we've got a tensor with this shape: count how many
   return CountAmults(row/r,col/c);
  
}

int main(){
  cin>>row >> col;
  while(row>0){
    //get matrix
    for(int r=0;r<row;r++)
      for(int c=0;c<col;c++)
        cin>>M[r][c];

    Total = 0;
    for(int R=1;R<=row;R++)
      if(row % R == 0)
        for(int C=1;C<=col;C++)
          if(col % C == 0)
            if(C!=1 || R!=1)
            if(C!=col || R!=row){    //non-trivial submatrix
            //submatrix of dim (R,C) divides (row,col)
             Total += CountTensors(R,C);   
            }

    cout<<Total<<endl;
    cin>>row>>col;
  }

  return 0;
}