import java.util.Scanner;

public class Main {
    private static final int MOD = 1_000_000_007;
    private static final String YES = "Yes";
    private static final String NO = "No";

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int N = sc.nextInt();
        int M = sc.nextInt();
        int C = sc.nextInt();
        int[] B = new int[M];
        for (int i=0; i<M; i++) {
            B[i] = sc.nextInt();
        }

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

        }

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

    private static int solve(int N, int M, int C, int[] B, int[][] A) {
        int count = 0;

        for (int i=0; i<N; i++) {
            int value = 0;
            for (int j=0; j<M; j++) {
                value += A[i][j] * B[j];
            }
            value += C;

            if (value > 0) count++;
        }

        return count;
    }
}
/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz