#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) for (int i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
const int mod = 1000000007;
const long long INF = 1LL << 60;
using ll = long long;

int main()
{
  ll N,M;
  cin >> N >> M;

  set<ll> se;
  rep(i,N){
    ll a;
    se.insert(a);
  }

  ll ans=se.size();
  cout << ans << " ";

  if(ans==1&&N==M){
    cout << 1 << endl;
  }
  else{
    cout << 0 << endl;
  }
}