import java.util.Scanner;

public class Main {
  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];
    int[][] A = new int[N][M];
    for (int i = 0; i < M; i++) {
      B[i] = sc.nextInt();
    }
    for (int i = 0; i < N; i++) {
      for (int j = 0; j < M; j++) {
        A[i][j] = sc.nextInt();
      }
    }
    Main abc122B = new Main();
    System.out.println(abc122B.solve(N, M, C, B, A));
  }

  public int solve(int N, int M, int C, int[] B, int[][] A) {
    int ans = 0;
    for (int[] a : A) {
      int sum = C;
      for (int i = 0; i < M; i++) {
        sum += a[i] * B[i];
      }
      if (sum > 0) ans += 1;
    }

    return ans;
  }
}

/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