Problem: Finally Fox Ciel arrived in front of her castle!

She have to type a password to enter her castle. An input device attached to her castle is a bit unusual.

The input device is a 1 × n rectangle divided into n square panels. They are numbered 1 to n from left to right. Each panel has a state either ON or OFF. Initially all panels are in the OFF state. She can enter her castle if and only if x1-th, x2-th, ..., xk-th panels are in the ON state and other panels are in the OFF state.

She is given an array a1, ..., al. In each move, she can perform the following operation: choose an index i (1 ≤ i ≤ l), choose consecutive ai panels, and flip the states of those panels (i.e. ON → OFF, OFF → ON).

Unfortunately she forgets how to type the password with only above operations. Determine the minimal number of operations required to enter her castle.

Input

The first line contains three integers n, k and l (1 ≤ n ≤ 10000, 1 ≤ k ≤ 10, 1 ≤ l ≤ 100), separated by single spaces.

The second line contains k integers x1, ..., xk (1 ≤ x1 < x2 < ... < xk ≤ n), separated by single spaces.

The third line contains l integers a1, ..., al (1 ≤ ai ≤ n), separated by single spaces. It is possible that some elements of the array ai are equal value.

Output

Print the minimal number of moves required to type the password. If it's impossible, print -1.

Examples

Input

10 8 2
1 2 3 5 6 7 8 9
3 5


Output

2


Input

3 2 1
1 2
3


Output

-1

Note

One possible way to type the password in the first example is following: In the first move, choose 1st, 2nd, 3rd panels and flip those panels. In the second move, choose 5th, 6th, 7th, 8th, 9th panels and flip those panels.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 10005;
int can[N], data[N];
vector<int> msk;
int Road[1100], cost[1100000];
long long dp[1100000];
int n, m, k;
int dis[N];
void bfs(int s) {
  memset(dis, 0x3f, sizeof(dis));
  dis[s] = 0;
  queue<int> Q;
  Q.push(s);
  while (!Q.empty()) {
    int f = Q.front();
    Q.pop();
    for (int i = (0); i < (k); ++i) {
      if (f - Road[i] >= 1) {
        int nxt = f - Road[i];
        if (dis[nxt] > dis[f] + 1) {
          dis[nxt] = dis[f] + 1;
          Q.push(nxt);
        }
      }
      if (f + Road[i] <= n) {
        int nxt = f + Road[i];
        if (dis[nxt] > dis[f] + 1) {
          dis[nxt] = dis[f] + 1;
          Q.push(nxt);
        }
      }
    }
  }
}
int solve(int mask) {
  int ans = 0;
  while (mask) ans += mask % 2, mask >>= 1;
  return ans % 2 == 0;
}
int main() {
  memset(dp, 0x3f, sizeof(dp));
  scanf("%d%d%d", &n, &m, &k);
  n++;
  for (int i = (0); i < (m); ++i) {
    int a;
    scanf("%d", &a);
    can[a] = 1;
  }
  for (int i = (0); i < (k); ++i) scanf("%d", &Road[i]);
  for (int i = (1); i < (n + 1); ++i) {
    data[i] = can[i] ^ can[i - 1];
    if (data[i]) msk.push_back(i);
  }
  for (int i = (0); i < ((int)msk.size()); ++i) {
    bfs(msk[i]);
    for (int j = (i + 1); j < ((int)msk.size()); ++j) {
      cost[(1 << i) ^ (1 << j)] = dis[msk[j]];
    }
  }
  dp[0] = 0;
  for (int mask = (1); mask < (1 << (int)msk.size()); ++mask)
    if (solve(mask)) {
      vector<int> V;
      for (int j = (0); j < ((int)msk.size()); ++j)
        if (mask >> j & 1) V.push_back(j);
      for (int j = (1); j < ((int)V.size()); ++j)
        dp[mask] = min(dp[mask], dp[mask ^ (1 << V[0]) ^ (1 << V[j])] +
                                     cost[(1 << V[0]) ^ (1 << V[j])]);
    }
  long long ans = dp[(1 << (int)msk.size()) - 1];
  if (ans > 1e9)
    puts("-1");
  else
    printf("%lld\n", ans);
  return 0;
}