#include <bits/stdc++.h>
using namespace std;
const int maxn = 1123456;
bitset<maxn> dp;
bool vis[maxn];
int p[maxn], w[maxn], have[maxn], val[maxn];
int n, k, tot, tt, mmax;
int main() {
  scanf("%d%d", &n, &k);
  for (int(i) = (1); (i) <= (n); (i)++) scanf("%d", p + i);
  for (int(i) = (1); (i) <= (n); (i)++) {
    int now = i, cnt = 0;
    while (!vis[now]) {
      vis[now] = true;
      now = p[now];
      cnt++;
    }
    if (cnt) {
      if (!have[cnt]) w[++tot] = cnt;
      have[cnt]++;
    }
  }
  for (int(i) = (1); (i) <= (tot); (i)++) mmax += w[i] / 2 * have[w[i]];
  if (mmax >= k)
    mmax = 2 * k;
  else
    mmax += k;
  mmax = min(mmax, n);
  for (int(i) = (1); (i) <= (tot); (i)++) {
    for (int j = 1; j <= have[w[i]]; j <<= 1) {
      val[++tt] = j * w[i];
      have[w[i]] -= j;
    }
    if (have[w[i]] > 0) val[++tt] = have[w[i]] * w[i];
  }
  dp.set(0);
  for (int(i) = (1); (i) <= (tt); (i)++) dp |= dp << val[i];
  if (dp[k])
    printf("%d %d", k, mmax);
  else
    printf("%d %d", k + 1, mmax);
}
