import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	}

	private static long solve(int n, int m, int c, int[] b, int[][] a) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	}
} import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	}

	private static long solve(int n, int m, int c, int[] b, int[][] a) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	} main {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = Integer.parseInt(sc.next()); N Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int M = Integer.parseInt(sc.next()); M Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int C = Integer.parseInt(sc.next()); C Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[] B = new int[M]; B new int[M] M for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		} int i = 0; int i = 0; i 0 i < M i M i++ i++ i {
			B[i] = Integer.parseInt(sc.next());
		} {
			B[i] = Integer.parseInt(sc.next());
		} B[i] = Integer.parseInt(sc.next()) B[i] B i Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc int[][] A = new int[N][M]; A new int[N][M] N M for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		} int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		} {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		} for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			} int j = 0; int j = 0; j 0 j < M j M j++ j++ j {
				A[i][j] = Integer.parseInt(sc.next());
			} {
				A[i][j] = Integer.parseInt(sc.next());
			} A[i][j] = Integer.parseInt(sc.next()) A[i][j] A[i] A i j Integer.parseInt(sc.next()) Integer.parseInt Integer sc.next() sc.next sc long ans = solve(N, M, C, B, A); ans solve(N, M, C, B, A) solve N M C B A System.out.println(ans) System.out.println System.out System System.out ans String[] args args private static long solve(int n, int m, int c, int[] b, int[][] a) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	} solve {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	} int ans = 0; ans 0 for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		} int i = 0; int i = 0; i 0 i < n i n i++ i++ i {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		} {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		} int tmp = c; tmp c for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			} int j = 0; int j = 0; j 0 j < m j m j++ j++ j {
				tmp += a[i][j] * b[j];
			} {
				tmp += a[i][j] * b[j];
			} tmp += a[i][j] * b[j] tmp a[i][j] * b[j] a[i][j] a[i] a i j b[j] b j if (tmp > 0) {
				ans++;
			} tmp > 0 tmp 0 {
				ans++;
			} ans++ ans return ans; ans int n n int m m int c c int[] b b int[][] a a public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	}

	private static long solve(int n, int m, int c, int[] b, int[][] a) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	}
} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	}

	private static long solve(int n, int m, int c, int[] b, int[][] a) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	}
} Main
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = Integer.parseInt(sc.next());
		int M = Integer.parseInt(sc.next());
		int C = Integer.parseInt(sc.next());

		int[] B = new int[M];
		for (int i = 0; i < M; i++) {
			B[i] = Integer.parseInt(sc.next());
		}
		int[][] A = new int[N][M];
		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				A[i][j] = Integer.parseInt(sc.next());
			}
		}

		long ans = solve(N, M, C, B, A);
		System.out.println(ans);
	}

	private static long solve(int n, int m, int c, int[] b, int[][] a) {
		int ans = 0;
		for (int i = 0; i < n; i++) {
			int tmp = c;
			for (int j = 0; j < m; j++) {
				tmp += a[i][j] * b[j];
			}

			// System.err.printf("A%s SUM%s\n", i,tmp);
			if (tmp > 0) {
				ans++;
			}
		}
		return ans;
	}
}
