#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
inline int read() {
  int x = 0;
  char ch = getchar();
  for (; !isdigit(ch); ch = getchar())
    ;
  for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
  return x;
}
bitset<N> B;
int n, p[N], k, K, ans[2], lef, c[N];
bool v[N];
inline int getlen(int x) {
  int an = 0;
  for (; !v[x]; x = p[x]) v[x] = 1, an++;
  return an;
}
inline void solve0() {
  for (int i = 1, now; i <= n; i++)
    if (!v[i]) {
      now = getlen(i), c[now]++;
      lef += now & 1, now ^= now & 1;
      if (K >= (now >> 1))
        K -= now >> 1, ans[0] += now;
      else if (K)
        ans[0] += K << 1, K = 0;
    }
  if (K) ans[0] += min(K, lef);
}
inline void solve1() {
  B[0] = 1;
  for (int i = 1; i <= n; i++)
    if (c[i]) {
      B |= B << i, c[i]--;
      if (c[i] & 1) B |= B << i;
      c[i << 1] += c[i] >> 1;
    }
  ans[1] = B[k] ? k : k + 1;
}
int main() {
  n = read(), K = k = read();
  for (int i = 1; i <= n; i++) p[i] = read();
  solve0(), solve1();
  printf("%d %d\n", ans[1], ans[0]);
  return 0;
}
