#include <bits/stdc++.h>
using namespace std;
int n, k, p;
int tot, head[100010], next1[100010 << 1], to[100010 << 1];
int deep[100010], cnt[100010];
void add(int x, int y) {
  to[++tot] = y;
  next1[tot] = head[x];
  head[x] = tot;
}
void dfs(int x, int f) {
  deep[x] = deep[f] + 1;
  cnt[deep[x]]++;
  for (int i = head[x]; i; i = next1[i]) {
    int y = to[i];
    if (y == f) continue;
    dfs(y, x);
  }
}
int main() {
  scanf("%d%d%d", &n, &k, &p);
  for (int i = 1; i < n; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    add(x, y);
    add(y, x);
  }
  dfs(1, 0);
  sort(deep + 1, deep + n + 1);
  int l = 2, r = 2, ans = 1, tmp = 0;
  while (1) {
    if (l >= n || r >= n) break;
    r++;
    if (deep[r] != deep[r - 1]) tmp += (r - l);
    while (tmp > p || r - l + 1 > k) {
      tmp -= (deep[r] - deep[l]);
      l++;
    }
    ans = max(ans, (r - l + 1));
  }
  printf("%d", ans);
  return 0;
}
