while (m < colm) && (k != str)
 {
    k = 0;
    for (int n = 0; n<str; n++)
    {
        if matr[n,m]>0
            k++;
    }
    if k == str
     return m;
    m++
 }