//
    //***************************************************
    //                      y - left
    //***************************************************
    //
    int l1,l2 = 0;
    x = 0;
    y = 0;
    k = 0;
    z = 0;
    s = 0;

    x = (int)(e->y() / 40);
    y = (int)(e->x() / 40);

    l1 = y;
    l2 = y;

    if (field[x][y] != field[x][y - 1] && fields[x][y - 1].checked)
    {
       l1 = l1 - 1;

       while (l1 > -1)
       {
           if (field[x][l1] == field[x][y])
           {
              s = l1;
              break;
           }
           l1--;
       }

       while (--l2 > s)
       {
         field[x][l2] = field[x][y];
       }
    }