#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define Test int T;cin>>T;while(T--)
#define PI acos(-1)
#define endl "\n"
#define fx(x) fixed<<setprecision(x)
#define sz(s) (int)s.size()
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define mem(a,n) memset((a),n,sizeof (a))
#define INF 1e18
#define ii pair<ll,ll>
ll gcd(ll x,ll y){return(!y?x:gcd(y,x%y));}
ll lcm(ll x,ll y){return x/gcd(x,y)*y;}
void file(){
#ifndef ONLINE_JUDGE
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#else
    //freopen("conan.in", "r", stdin);
    //freopen("bridges.out", "w", stdout);
#endif
}
void fast(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    file();
}
int dx[]= {0,0,1,-1};
int dy[]= {-1,1,0,0};
const double eps=1e-9;
const int mod=1e9+7;
const int N=1e6+5;
int main(){
    fast();
    int n,k,m;
    cin>>n>>k>>m;
    bool ok0=0,ok1=0;
    int sum=0;
    for(int i=0;i<n;i++){
        int x,y;
        cin>>x>>y;
        if(x%2==y%2)ok0=1;
        else ok1=1;
        sum+=x;
        sum%=2;
    }
    if(m==sum){
        if(!ok1||(!ok0&&k%2==0)||(ok1&&ok0&&k%2==1)){
            cout<<1<<endl;
        }
        else cout<<2<<endl;
    }
    else{
        if((!ok0&&k%2==1)||(ok1&&ok0&&k%2==1)){
            cout<<1<<endl;
        }
        else cout<<2<<endl;
    }
    return 0;
}