```go
package main

import (
	"bufio"
	"container/heap"
	"fmt"
	"os"
	"sort"
)

type Seat struct {
	D1, D2 int
}

type IntHeap []int

func (h IntHeap) Len() int           { return len(h) }
func (h IntHeap) Less(i, j int) bool { return h[i] > h[j] }
func (h IntHeap) Swap(i, j int)      { h[i], h[j] = h[j], h[i] }
func (h *IntHeap) Push(x interface{}) {
	*h = append(*h, x.(int))
}
func (h *IntHeap) Pop() interface{} {
	old := *h
	n := len(old)
	x := old[n-1]
	*h = old[0 : n-1]
	return x
}

func main() {
	in := bufio.NewReader(os.Stdin)
	var n, m int
	if _, err := fmt.Fscan(in, &n, &m); err != nil {
		return
	}

	var k int
	if _, err := fmt.Fscan(in, &k); err != nil {
		return
	}
	A := make([]int, k)
	for i := 0; i < k; i++ {
		fmt.Fscan(in, &A[i])
	}

	var l int
	if _, err := fmt.Fscan(in, &l); err != nil {
		return
	}
	B := make([]int, l)
	for i := 0; i < l; i++ {
		fmt.Fscan(in, &B[i])
	}

	seats := make([]Seat, 0, n*m)
	for x := 1; x <= n; x++ {
		for y := 1; y <= m; y++ {
			d1 := x + y
			d2 := x + m + 1 - y
			seats = append(seats, Seat{D1: d1, D2: d2})
		}
	}

	sort.Slice(seats, func(i, j int) bool {
		return seats[i].D1 < seats[j].D1
	})
	sort.Ints(A)
	sort.Ints(B)

	h := &IntHeap{}
	heap.Init(h)

	seatIdx := 0
	for _, a := range A {
		for seatIdx < len(seats) && seats[seatIdx].D1 <= a {
			heap.Push(h, seats[seatIdx].D2)
			seatIdx++
		}
		if h.Len() == 0 {
			fmt.Println("NO")
			return
		}
		heap.Pop(h)
	}

	rem := make([]int, 0, n*m-k)
	for _, d2 := range *h {
		rem = append(rem, d2)
	}
	for i := seatIdx; i < len(seats); i++ {
		rem = append(rem, seats[i].D2)
	}

	sort.Ints(rem)
	for i := 0; i < l; i++ {
		if rem[i] > B[i] {
			fmt.Println("NO")
			return
		}
	}

	fmt.Println("YES")
}
```