class Solution {
public:
    vector<int> selfDividingNumbers(int left, int right) {
        vector<int> vect1;
        int DigitsofNumber;
        int DigitDividesNumberCount =0;
        for (int number=left; number<=right;number++){
            int DigitInNumberCount = 0;
            while (number>0){
                DigitsofNumber = number % 10;
                DigitInNumberCount++;
                if (DigitsofNumber>0){
                    if (number % DigitsofNumber !=0)
                        break;
                    else
                        DigitDividesNumberCount++;
                    number = number/10;}
            }
            if (DigitInNumberCount == DigitDividesNumberCount){
                vect1.push_back(number);
            }
            else
                continue;
        }
        return vect1;

    }
};