/*
*
*"@NainwalArun"
*
*/
#include <bits/stdc++.h>
using namespace std ;

#define ft first
#define sd second
#define pb push_back
#define all(x) x.begin(),x.end()

#define ull unsigned long long int
#define ll long long int
#define vi vector<long long int>
#define vii vector<pair<long long int,long long int> >
#define pii pair<long long int,long long int>
#define mp make_pair
#define arun() int main()
#define loop(i, a, b) for(i=a; i<b; i++)
#define pool(i, a, b) for(i=a; i>b; i--)
const int N = 1e5 + 10;
const int mod = 1e9 + 7;
const ll INF = 1LL << 62;

ll power(ll x,ll y){
  ll t=1;
  while(y>0){
    if(y%2) y-=1,t=t*x%mod;
    else y/=2,x=x*x%mod;
  }
  return t;
}

ll inverse(ll q)
{
    ll t;
    t=power(q,mod-2);
    return t;
}


ll factors(ll n)
{
	ll cou=0,i,k=1,k1;
    for( i=2;i<=sqrt(n);i++){
        if(n%i==0){
            k1=0;
            while(n%i==0){
            	n=n/i;
            	k1++;
            }
            k=k*(k1+1);
        }
    }
    if(n!=1){
    	k=k*2;
    }
    return k;
}

ll fact(ll n){
    ll facti[100001];
    facti[0]=1;
    facti[1]=1;
    for(ll i=2;i<100001;i++){
        facti[i]=(facti[i-1]*i)%mod;
    }
    return facti[n];
}

ll gcd (ll a, ll b)
{
    ll c;

    if ( b == 0 )
        return a;

    else
        while ( b != 0 )
        {
            c = b;
            b = a % b;
            a = c;
        }

        return a;
}

bool cmp(pair<ll,ll>p1,pair<ll,ll>p2){
    if(p1.ft>p2.ft){
        return true;
    }
    else if(p1.ft==p2.ft){
        if(p1.sd<=p2.sd){
            return true;
        }
        else{
            return false;
        }
    }
    else{
        return false;
    }
}

ll prime[1000001]={0};

arun(){
    ll n,k,i,j,l;
    cin>>n>>k;
    ll a[n];
    loop(i,0,n){
        cin>>a[i];
    }
    ll ans=0;
    cout<<1<<endl;
return 0;

}