#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 5;
const int maxN = 45;
bool dp[maxN][maxN*maxN][maxN*maxN];
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m, k;
cin >> n >> m >> k;
vector<int> a(n), b(m);
for(int& i : a) {
cin >> i;
}
for(int& i : b) {
cin >> i;
}
int ans = INF;
for(int i : a) {
if (i < k) {
cout << "Impossible\n";
exit(0);
}
}
int time = accumulate(a.begin(), a.end(), 0);
dp[0][0][0] = true;
for(int i = 1; i <= m; i++) {
for(int j = 0; j < maxN*maxN; j++) {
for(int p = 0; p < maxN*maxN; p++) {
dp[i][j][p] |= dp[i-1][j][p];
if (j-b[i-1] < 0 || p-min(n, b[i-1]) < 0) continue;
dp[i][j][p] |= dp[i-1][j-b[i-1]][p-min(n, b[i-1])];
if (dp[i][j][p] && j >= time && p >= k*n) {
ans = min(ans, j-time);
}
}
}
}
if (ans == INF) {
cout << "Impossible\n";
} else {
cout << ans << "\n";
}
return 0;
}
