The farmer Polycarp has a warehouse with hay, which can be represented as an n × m rectangular table, where n is the number of rows, and m is the number of columns in the table. Each cell of the table contains a haystack. The height in meters of the hay located in the i-th row and the j-th column is equal to an integer ai, j and coincides with the number of cubic meters of hay in the haystack, because all cells have the size of the base 1 × 1. Polycarp has decided to tidy up in the warehouse by removing an arbitrary integer amount of cubic meters of hay from the top of each stack. You can take different amounts of hay from different haystacks. Besides, it is allowed not to touch a stack at all, or, on the contrary, to remove it completely. If a stack is completely removed, the corresponding cell becomes empty and no longer contains the stack.

Polycarp wants the following requirements to hold after the reorganization:

• the total amount of hay remaining in the warehouse must be equal to k,
• the heights of all stacks (i.e., cells containing a non-zero amount of hay) should be the same,
• the height of at least one stack must remain the same as it was,
• for the stability of the remaining structure all the stacks should form one connected region.

The two stacks are considered adjacent if they share a side in the table. The area is called connected if from any of the stack in the area you can get to any other stack in this area, moving only to adjacent stacks. In this case two adjacent stacks necessarily belong to the same area.

Help Polycarp complete this challenging task or inform that it is impossible.

The first line of the input contains three integers n, m (1 ≤ n, m ≤ 1000) and k (1 ≤ k ≤ 1018) — the number of rows and columns of the rectangular table where heaps of hay are lain and the required total number cubic meters of hay after the reorganization.

Then n lines follow, each containing m positive integers ai, j (1 ≤ ai, j ≤ 109), where ai, j is equal to the number of cubic meters of hay making the hay stack on the i-th row and j-th column of the table.

In the first line print "YES" (without quotes), if Polycarpus can perform the reorganisation and "NO" (without quotes) otherwise. If the answer is "YES" (without quotes), then in next n lines print m numbers — the heights of the remaining hay stacks. All the remaining non-zero values should be equal, represent a connected area and at least one of these values shouldn't be altered.

If there are multiple answers, print any of them.

In the first sample non-zero values make up a connected area, their values do not exceed the initial heights of hay stacks. All the non-zero values equal 7, and their number is 5, so the total volume of the remaining hay equals the required value k = 7·5 = 35. At that the stack that is on the second line and third row remained unaltered.

题意：

给这么一个n*m矩阵,里面的值只能减小不能增大,要求是否可以得到连在一块的且和为k的连通块,而且这里面至少有一个的值没变;

思路：

先按从大到小的顺序排序,然后再把挨着的用并查集连在一块,同时更新这个集里面的元素个数,等操作到这个元素的值*这个元素所属集的元素个数>=k&&k能整除元素的值的时候就是能输出答案的时候了;再用bfs找到那些要求的地方输出就行,注意使用并查集要路径压缩,否则会tle;

AC代码：

/*

2014300227    659F - 62    GNU C++11    Accepted    1044 ms    33596 KB

*/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=1e6+;

int p[N],a[][],num[N],n,m,ans[][],vis[][];

int dir[][]={,-,,,,,-,};

ll k;

struct node

{

    int hi,x,y;

};

node po[N];

int cmp(node u,node v)

{

    return u.hi>v.hi;

}

int findset(int x)

{

    if(x==p[x])return x;

    return p[x]=findset(p[x]);

}

void same(int x,int y)

{

    int fx=findset(x),fy=findset(y);

    if(fx!=fy)

    {

        p[fx]=fy;

        num[fy]+=num[fx];

        num[fx]=;

    }

}

int print(node r)

{

    memset(vis,,sizeof(vis));

    node temp;

    int nu=;

    queue<node>qu;

    qu.push(r);

    vis[r.x][r.y]=;

    while(!qu.empty())

    {

        node to=qu.front();

        qu.pop();

        for(int i=;i<;i++)

        {

            int px=to.x+dir[i][],py=to.y+dir[i][];

            if(px<||px>n||py<||py>m)continue;

            if(a[px][py]>=r.hi&&nu<k/r.hi&&vis[px][py]==)

            {

                temp.hi=a[px][py];

                temp.x=px;

                temp.y=py;

                qu.push(temp);

                vis[px][py]=;

                nu++;

            }

        }

    }

    for(int i=;i<=n;i++)

    {

        for(int j=;j<=m;j++)

        {

            if(vis[i][j])

            {

                printf("%d ",r.hi);

            }

            else printf("0 ");

        }

        printf("\n");

    }

}

int main()

{

    int cnt=;

    cin>>n>>m>>k;

    for(int i=;i<=n;i++)

    {

        for(int j=;j<=m;j++)

        {

            scanf("%d",&a[i][j]);

            po[cnt].hi=a[i][j];

            po[cnt].x=i;

            po[cnt].y=j;

            cnt++;

        }

    }

    for(int i=;i<N;i++)

    {

        p[i]=i;

        num[i]=;

    }

    sort(po+,po+cnt+,cmp);

    for(int i=;i<cnt;i++)

    {

        for(int j=;j<;j++)

        {

            int fx=po[i].x+dir[j][],fy=po[i].y+dir[j][];

            if(fx<=||fx>n||fy<=||fy>m)continue;

            if(a[fx][fy]>=po[i].hi)

            {

                same((fx-)*m+fy,(po[i].x-)*m+po[i].y);

            }

        }

            if(k%po[i].hi==){

            int fa=findset((po[i].x-)*m+po[i].y);

            ll s=(ll)num[fa]*(ll)po[i].hi;

            if(s>=k)

            {

                cout<<"YES"<<"\n";

                print(po[i]);

                return ;

            }

            }

    }

    printf("NO\n");

    return ;

}