import java.util.*;
public class itemselection_xiaowuc1 {
  public static void main(String[] args) throws Exception {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    int m = sc.nextInt();
    int s = sc.nextInt();
    int p = sc.nextInt();
    int q = sc.nextInt();
    boolean[] orig = new boolean[n+1];
    boolean[] want = new boolean[n+1];
    for(int i = 0; i < p; i++) orig[sc.nextInt()] = true;
    for(int i = 0; i < q; i++) want[sc.nextInt()] = true;
    int lvisit = 1 << 30;
    int rvisit = -1;
    int ret = 0;
    for(int i = 1; true; i++) {
      int lhsp = (i-1)*m+1;
      int rhsp = i*m;
      if(lhsp > n) break;
      int wanton = 0;
      int wantoff = 0;
      int needflip = 0;
      for(int a = lhsp; a <= rhsp && a <= n; a++) {
        if(want[a]) wanton++; else wantoff++;
        if(orig[a] != want[a]) needflip++;
      }
      int use = Math.min(1 + Math.min(wanton, wantoff), needflip);
      ret += use;
      if(use > 0) {
        lvisit = Math.min(lvisit, i);
        rvisit = Math.max(rvisit, i);
      }
    }
    if(ret > 0) {
      ret += rvisit - lvisit + Math.min(Math.abs(lvisit - s), Math.abs(rvisit-s));
    }
    System.out.println(ret);
  }
}