Problem: Olya likes milk very much. She drinks k cartons of milk each day if she has at least k and drinks all of them if she doesn't. But there's an issue — expiration dates. Each carton has a date after which you can't drink it (you still can drink it exactly at the date written on the carton). Due to this, if Olya's fridge contains a carton past its expiry date, she throws it away.

Olya hates throwing out cartons, so when she drinks a carton, she chooses the one which expires the fastest. It's easy to understand that this strategy minimizes the amount of cartons thrown out and lets her avoid it if it's even possible.

<image> Milk. Best before: 20.02.2017.

The main issue Olya has is the one of buying new cartons. Currently, there are n cartons of milk in Olya's fridge, for each one an expiration date is known (how soon does it expire, measured in days). In the shop that Olya visited there are m cartons, and the expiration date is known for each of those cartons as well.

Find the maximum number of cartons Olya can buy so that she wouldn't have to throw away any cartons. Assume that Olya drank no cartons today. 

Input

In the first line there are three integers n, m, k (1 ≤ n, m ≤ 106, 1 ≤ k ≤ n + m) — the amount of cartons in Olya's fridge, the amount of cartons in the shop and the number of cartons Olya drinks each day.

In the second line there are n integers f1, f2, ..., fn (0 ≤ fi ≤ 107) — expiration dates of the cartons in Olya's fridge. The expiration date is expressed by the number of days the drinking of this carton can be delayed. For example, a 0 expiration date means it must be drunk today, 1 — no later than tomorrow, etc.

In the third line there are m integers s1, s2, ..., sm (0 ≤ si ≤ 107) — expiration dates of the cartons in the shop in a similar format.

Output

If there's no way for Olya to drink the cartons she already has in her fridge, print -1.

Otherwise, in the first line print the maximum number x of cartons which Olya can buy so that she wouldn't have to throw a carton away. The next line should contain exactly x integers — the numbers of the cartons that should be bought (cartons are numbered in an order in which they are written in the input, starting with 1). Numbers should not repeat, but can be in arbitrary order. If there are multiple correct answers, print any of them.

Examples

Input

3 6 2
1 0 1
2 0 2 0 0 2


Output

3
1 2 3

Input

3 1 2
0 0 0
1


Output

-1

Input

2 1 2
0 1
0


Output

1
1 

Note

In the first example k = 2 and Olya has three cartons with expiry dates 0, 1 and 1 (they expire today, tomorrow and tomorrow), and the shop has 3 cartons with expiry date 0 and 3 cartons with expiry date 2. Olya can buy three cartons, for example, one with the expiry date 0 and two with expiry date 2.

In the second example all three cartons Olya owns expire today and it means she would have to throw packets away regardless of whether she buys an extra one or not.

In the third example Olya would drink k = 2 cartons today (one she alreay has in her fridge and one from the shop) and the remaining one tomorrow.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e6 + 10;
int n, m, k;
int f[N];
int s[N];
int pre[N];
long long suf[N];
vector<int> id[N];
vector<int> ans;
int idx;
unordered_map<int, int> M;
unordered_map<int, int> rev;
inline void compress() {
  vector<int> vec;
  for (int i = 1; i <= n; ++i) vec.push_back(f[i]);
  for (int i = 1; i <= m; ++i) vec.push_back(s[i]);
  sort(vec.begin(), vec.end());
  vec.erase(unique(vec.begin(), vec.end()), vec.end());
  for (auto i : vec) {
    M[i] = ++idx;
    rev[idx] = i;
  }
  for (int i = 1; i <= n; ++i) f[i] = M[f[i]];
  for (int i = 1; i <= m; ++i) s[i] = M[s[i]];
}
inline bool solve() {
  compress();
  for (int i = 1; i <= n; ++i) ++pre[f[i]];
  vector<int> S;
  for (int i = 1; i <= m; ++i) {
    id[s[i]].push_back(i);
    S.push_back(s[i]);
  }
  sort(S.begin(), S.end());
  for (int i = 1; i <= idx; ++i) {
    pre[i] += pre[i - 1];
    if (pre[i] > 1LL * (rev[i] + 1) * k) return false;
  }
  suf[idx] = 1LL * k * (rev[idx] + 1) - pre[idx];
  for (int i = idx - 1; i >= 1; --i)
    suf[i] = min(1LL * (rev[i] + 1) * k - pre[i], suf[i + 1]);
  int add = 0;
  for (int i = 0; i < S.size(); ++i) {
    int x = S[i];
    if (suf[x] - add - 1 >= 0) {
      ++add;
      ans.push_back(id[x].back());
      id[x].pop_back();
    }
  }
  return true;
}
int main() {
  scanf("%d %d %d", &n, &m, &k);
  for (int i = 1; i <= n; ++i) scanf("%d", &f[i]);
  for (int i = 1; i <= m; ++i) scanf("%d", &s[i]);
  if (!solve())
    printf("-1\n");
  else {
    printf("%d\n", ans.size());
    for (auto i : ans) printf("%d ", i);
    printf("\n");
  }
  return 0;
}