Tamzid_boss

/*  TAHMID RAHMAN
    DAMIAN FOREVER
     MATH LOVER
    NEVER GIVE UP
*/
#include<bits/stdc++.h>
using namespace std;
#define pi acos(-1.0)
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL)
#define ll long long
#define pb push_back
#define fi first
#define se second
#define in insert
#define mp make_pair
#define GCD(a,b) __gcd(a,b);
#define endl "\n"
#define FRU freopen("out.txt","w",stdout)
#define FRO freopen("in.txt","r",stdin)
#define INFLL 9223372036854775807
#define debug 0
#define MAXN   100001
#define ar array
#define lb lower_bound
#define ub upper_bound
const int mxN=2e5;
const int MOD=1e9+7;
template<typename ForwardIterator, typename T>
ForwardIterator first_less_than (ForwardIterator first, ForwardIterator last, T value)
{auto it = std::lower_bound (first, last, value);
return (it == first ? last : --it);}
bool sortbysec(const pair<int,int> &a,const pair<int,int> &b)
{
    return (a.second < b.second);
}
#define debugxx(v) {for(auto x:v){cout<<x.fi<<" "<<x.se<<endl;}cout<<endl;}
#define debugx(v){for(auto y:v) {cout<<y<<" ";}cout<<endl;}
//Don't hesitate to ask me if you don't understand my code.......Happy coding,Tahmid...;

ll n,m;

ll a[10000][10000];

bool bs(ll k)
{
    ll i=0,j=0;

    while(i<n)
    {
        if(a[i][0]<=k&&a[i][m-1]>=k)
        {
            ll l=0,h=m-1;
            ll mid;

            while(l<=h)
            {
                mid=(l+h)/2;

                if(a[i][mid]==k)
                    return true;

                if(a[i][mid]<k)
                {
                    l=mid+1;
                }
                else
                    h=mid-1;
            }
        }
        else
            i++;


    }

    return false;


}

int main()
{
    fastio;
    ll k,i,j;
    cin>>n>>m>>k;

    for(i=0;i<n;i++)
    {
        for(j=0;j<m;j++)
        {
            cin>>a[i][j];
        }
    }


    if(bs(k))
        cout<<"True"<<endl;
    else
        cout<<"False"<<endl;

}