#include <bits/stdc++.h>
#define rep(i, a, b) for (int i = a; i <= b; i++)
#define per(i, b, a) for (int i = b; i >= a; i--)
using namespace std;

const int N = 5005;

set <int> all;
vector <int> vec[N];
int a[N];
int m, n, x, ans;

int main() {
	scanf("%d%d%d", &m, &n, &x);
	for (int i = 1; i <= n; i++) {
		int t;
		scanf("%d", &t);
		all.insert(t);
	}
	for (int i = 0; i < x; i++) {
		for (auto j : vec[i]) all.insert(j);
		while (m && all.size()) {
			int t = *all.begin();
			all.erase(all.begin());
			--m;
			if (i + t > x) ++ans;
			else vec[i + t].push_back(t);
		}
	}
	printf("%d %d\n", m, ans);
	return 0;
}