while(true) {
        if (resultTable[i][j] == 0) {
            break;
        }

        if (resultTable[i - 1][j] == resultTable[i][j]) {
            --i;
            continue;
        }

        else /*if (resultTable[i - 1][j - data[i][0]] == resultTable[i][j])*/{
            if(i != 0) {
                restore[ind] = i;
                ++ind;
                j = j - data[i][0];
                --i;
            }
            continue;

        }

    }

    for (int s = 0; s < (ind + 1)/ 2; ++s) {
        swap(restore[s], restore[ind - 1 - s]);
    }

    for (int k = 0; k < ind; ++k){
        cout << restore[k] << '\n';
    }