class Solution {
public static boolean isSelfDividing( int i){
for ( int x = i ; x > 0 ; x /=10){
int m = x % 10;
if( m == 0 /*to avoid i%0*/|| i % m != 0) return false;
}
return true;
}
public List selfDividingNumbers(int left, int right) {
List out = new ArrayList();
for ( int i = left ; i <= right ; i++ ){
if ( isSelfDividing(i)) out.add(i);
}
return out;
}
}