PAT1068

#include<iostream>
#include <iomanip>
#include <cstdio>
#include<string>
#include<vector>
#include<array>
#include<math.h>
#include <ctype.h>
#include<algorithm>
#include <set>
#include <map>
using namespace std;

int direction[8][2] = { {-1,-1},
					   {-1,0},
					   {-1,1},
					   {0,-1},
					   {0,1},
					   {1,-1},
					   {1,0},
					   {1,1}
};
int m, n, t;

int a[1001][1001];

int judge(int i, int j)
{
	int x, y,k;
	for (k = 0; k < 8; k++)
	{
		x = i + direction[k][0];
		y = j + direction[k][1];//通过坐标位置加减1来找到八个点
		if (x >= 1 && x <= n && y >= 1 && y <= m && abs(a[x][y] - a[i][j]) <= t)
			return 0;
	}
	return 1;
}

int main()
{
	int i, j;
	cin >> m >> n >> t;
	map<int, int> s;
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= m; j++)
		{
			cin >> a[i][j];
			s[a[i][j]]++;//记录该数值的数量
		}
	}
	int flag = 0,r = 0, c = 0, num = 0;
	for (i = 1; i <= n; i++)
	{
		for (j = 1; j <= m; j++)
		{
			if (judge(i, j) && s[a[i][j]] == 1)
			{
				num++;
				flag = 1;
				r = i;
				c = j;
			}
		}
	}
	if (flag && num == 1)
		printf("(%d, %d): %d\n", c, r, a[r][c]);
	else if (num > 1 && flag)
		printf("Not Unique\n");
	else if (!flag)
		printf("Not Exist\n");
	return 0;
}