while(memory[i*row+j]!=0)
    {
        l  = memory[i*row+j - 1];
        u  = memory[i*row+j - row];
        ul = memory[i*row+j - row - 1];
        maxValue = maxFun(l,u,ul);
        if(maxValue == ul)
        {
            p.insert(p.begin(),std::tuple<'m',s1[i-1],s2[j-1]>);
            i--;
            j--;
        }
        if(maxValue==u)
        {
            //p.insert(p.begin(),'d');//Gi[i][j]+1);
            p.insert(p.begin(),std::tuple<'d',s2[j-1],'-'>);
            i = i - 1;  //- Gi[i][j] - 1;
        }
        if(maxValue==l)
        {
            //p.insert(p.begin(),'i');
            p.insert(p.begin(),std::tuple<'i','-',s1[i-1]>);
            j = j - 1; //- Gd[i][j] - 1;
        }