#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
 
#define         pb         push_back
#define         sf(x)      scanf("%d",&x)
#define         sfl(x)     scanf("%lld",&x)
#define         pf(x)      printf("%d\n",x)
#define         pfl(x)     printf("%lld\n",x)
#define         endl       '\n'
#define         pii        pair<int,int>
#define         mapii      map<int,int>
#define         mapll      map<ll,ll>
#define         mapci      map<char,int>
#define         mapcl      map<char,ll>
#define         mapsi      map<string,int>
#define         mapsl      map<string,ll>
#define         pll        pair<ll,ll>
#define         vi         vector<int>
#define         vl         vector<ll>
#define         vd         vector<double,double>
#define         all(c)     c.begin(),c.end()
#define         F          first
#define         S          second
#define         mp         make_pair
#define        ftc(x)      cerr << #x << ": " << x << " " << endl;
#define         PI         acos(-1)
#define        lcm(a,b)   ((a*b)/__gcd(a,b))
#define        optimize    ios_base::sync_with_stdio(false);cin.tie(NULL);
#define        sqr(a)       ((a)*(a))
 
int main()
{
    int tst;
 
    tst = 1;
 
    // cin >> tst;
 
    while(tst--)
    {
        ll i,j,k,l,m,n,x;
 
        cin >> n >> k>> x;
 
        ll ans = 0;
 
        ll ar[n+10];
        ll ar1[n+10];
        ll ar2[n+10];
 
        for(i=0; i<n; i++)cin >> ar[i];
 
        sort(ar,ar+n);
 
        for(i=0; i<n; i++)ar1[i] = ar[i];
        for(i=0; i<n; i+=2)ar1[i] = ar[i]^x;
 
        sort(ar1,ar1+n);
 
        for(i=0; i<n; i++)ar2[i] = ar1[i];
        for(i=0; i<n; i+=2)ar2[i] = ar1[i]^x;
 
        sort(ar2,ar2+n);
 
        if(k%2)
        {
            cout << ar1[n-1] << " " << ar1[0] << endl;
        }
        else cout << ar2[n-1] << " " << ar2[0] << endl;
    }
}