#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define V vector
typedef long long LL;
const int mod = 998244353;
LL qpow(int x, LL k) {
    LL ans = 1;
    while(k) {
        if(k & 1) ans = ans * x % mod;
        x = 1LL * x * x % mod;
        k >>= 1;
    }
    return ans;
}
LL a[5005];
void solve() {
    int m,n,x;
    cin>>m>>n>>x;
    for(int i=1;i<=n;i++){
        cin>>a[i];
    }
    sort(a+1,a+1+n);
    int c0=m,c1=0;

    for(int i=1;i<=x;i++){
        for(int j=1;j<=n;j++){
            if(i%a[j]==1%a[j]){
                if(c0>0)
                c0--,c1++;
            }
            if(i%a[j]==0){
                if(c1>0)
                c1--;
            }
        }
    }
    cout<<c0<<' '<<c1<<'\n';
}

int main() {
    int t = 1; 
    // cin >> t;
    while(t--) solve();
}