#include <bits/stdc++.h>
using namespace std;
int mas[1000100];
vector<int> chet;
vector<int> nechet;
int vis[1000100];
void dfs(int s, int cnt) {
  vis[s] = true;
  if (vis[mas[s]]) {
    if (cnt % 2 == 0) {
      chet.push_back(cnt);
    } else {
      nechet.push_back(cnt);
    }
    return;
  }
  dfs(mas[s], cnt + 1);
}
int calcmaxi(int k) {
  int res = 0;
  for (int i = (int)(nechet).size() - 1; i >= 0; i--) {
    int cnt = nechet[i] / 2;
    res += min(k, cnt) * 2;
    k -= min(k, cnt);
    if (!k) return res;
  }
  for (int i = (int)(chet).size() - 1; i >= 0; i--) {
    int cnt = chet[i] / 2;
    res += min(k, cnt) * 2;
    k -= min(k, cnt);
    if (!k) return res;
  }
  res += min(k, (int)(nechet).size());
  return res;
}
int gcd(int a, int b) {
  if (!a) return b;
  return gcd(b % a, a);
}
int n;
int calcmini(int k) {
  if (k == 0) return 0;
  int saveK = k;
  vector<int> w;
  for (int i = 0; i < (int)(chet).size(); i++) {
    w.push_back(chet[i]);
  }
  for (int i = 0; i < (int)(nechet).size(); i++) {
    w.push_back(nechet[i]);
  }
  sort(w.begin(), w.end());
  vector<int> dp(k + 1);
  int maxval = 0;
  dp[0] = 1;
  for (int i = 0; i < (int)(w).size(); i++) {
    int cnt = 1;
    while (i + 1 < (int)(w).size() && w[i] == w[i + 1]) i++, cnt++;
    for (int j = maxval; j >= 0; j--) {
      if (dp[j]) {
        int cur = j;
        for (int x = 1; x <= cnt; x++) {
          int W = cur + x * w[i];
          if (W == k) return saveK;
          if (W > k) break;
          if (dp[W]) break;
          dp[W] = 1;
          if (W > maxval) maxval = W;
        }
      }
    }
  }
  return saveK + 1;
}
int main() {
  scanf("%d", &n);
  int k;
  scanf("%d", &k);
  for (int i = 1; i <= n; i++) scanf("%d", &mas[i]);
  for (int i = 1; i <= n; i++) {
    if (!vis[i]) {
      dfs(i, 1);
    }
  }
  sort(chet.begin(), chet.end());
  sort(nechet.begin(), nechet.end());
  int maxi = calcmaxi(k);
  int mini = calcmini(k);
  printf("%d %d\n", mini, maxi);
  return 0;
}
