#include<bits/stdc++.h>
using namespace std;
 
// typedef vector <int> vi;
// typedef pair< int ,int > pii;
// #define endl "\n"
// #define sd(val) scanf("%d",&val)
// #define ss(val) scanf("%s",&val)
// #define sl(val) scanf("%lld",&val)
// #define debug(val) printf("check%d\n",val)
// #define all(v) v.begin(),v.end()
// #define PB push_back
// #define MP make_pair
// #define FF first
// #define SS second
// #define ll long long
// #define MOD 1000000007
// #define clr(val) memset(val,0,sizeof(val))
// #define what_is(x) cerr << #x << " is " << x << endl; 
// #define OJ \
//     freopen("input.txt", "r", stdin); \
//     freopen("output.txt", "w", stdout);
// #define FIO ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);

void search(int a[][1000],int m,int n,int k){
    if(k<a[0][0] || k>a[m-1][n-1]){
        cout<<"The element is not present in the array";
        return;
    }
    int i=0;
    int j=n-1;
    while(i<=m-1 && j>=0){
        if(a[i][j]==k){
            cout<<"The key is at "<< i<<","<<j;
            return;
        }
        else if(a[i][j]<k){
            i++;
        }
        else{
            j--;
        }
    }
    cout<<" Not Found";
    return;

} 


int main(){
    int a[1000][1000]={{1,4,8,10},{2,5,9,15},{6,16,18,20}};
    search(a,3,4,15);
    return 0;
}