#include <iostream>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <sstream>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <fstream>
#include <numeric>
#include <iomanip>
#include <bitset>
#include <list>
#include <stdexcept>
#include <functional>
#include <utility>
#include <ctime>


typedef long double ld;
typedef long long ll;
using namespace std;
const ll MX=1e6+9;
const int MAXN = 10100;
const ld pi = acos(-1);
const ll mod = 1e9+7;

//bool cmp ( int a,int b ) { return a>b; }
ll vl;
ll po ( ll a , ll b )
{
    if ( b==0 ) { return 1; }
    ll x = po ( a , b/2 );
    x *= x;
    if ( b%2 ) { x*=a; }
    return x;
}
int power(int p)
{
    if(p==0)return 1;
    if(p==1)return vl;
    if(p%2)return (vl*power(p-1))%mod;
    long long x=power(p/2);
    return (x*x)%mod;
}
int mod_inv(ll a,ll b)
{
    vl=b;
    return (a*power(mod-2))%mod;
}
ll gcd (  ll a , ll b )
{
    if ( b==0 ) return a;
    else { return gcd( b , a%b ); }
}

bool cmp ( int a , int b ) { return (a>b); }
int dx[]={ 0 , 0 , -1 , 1 };
int dy[]={ 1 , -1 , 0 , 0 };

int a[MX];
int b[MX];
int main()
{
    ll n,k,x;
    cin>>n>>k>>x;

    for ( int i=0 ; i<n ; i++ )
    {
        scanf ( "%d" , &a[i] );
        b[i] = a[i];
    }
    int q=2;



        sort ( a , a+n );
        for ( int i=0 ; i<n ; i++ )
        {
            if ( !(i&1) ) { a[i] ^= x; }
            //cout<<a[i]<<" ";
        }
        //cout<<endl;

        while ( q-- )
        {
            sort ( b , b+n );
            for ( int i=0 ; i<n ; i++ )
            {
                if ( !(i&1) ) { b[i] ^= x; }
                //cout<<a[i]<<" ";
            }
        }
        ll mn =1e18;
        ll mx = -1e18;

        if ( k%2 )
        {
            for ( int i=0 ; i<n ; i++ )
            {


            mn = min ( mn , ll(a[i]) );
            mx = max( mx , ll(a[i]) );
            }
            cout<<mx<<" "<<mn; return 0;
        }
        else
        {
             for ( int i=0 ; i<n ; i++ )
            {
            mn = min ( mn , ll(b[i]) );
            mx = max( mx , ll(b[i]) );
            }
            cout<<mx<<" "<<mn; return 0;
        }


    return 0;
}