Problem:
 Score : 200 points    Problem Statement There are N pieces of source code. The characteristics of the i -th code is represented by M integers A_{i1}, A_{i2}, ..., A_{iM} .  Additionally, you are given integers B_1, B_2, ..., B_M and C .  The i -th code correctly solves this problem if and only if A_{i1} B_1 + A_{i2} B_2 + ... + A_{iM} B_M + C > 0 .  Among the N codes, find the number of codes that correctly solve this problem.      Constraints  All values in input are integers.  1 \leq N, M \leq 20  -100 \leq A_{ij} \leq 100  -100 \leq B_i \leq 100  -100 \leq C \leq 100         Input Input is given from Standard Input in the following format:  N  M  C  B_1  B_2  ...  B_M  A_{11}  A_{12}  ...  A_{1M}  A_{21}  A_{22}  ...  A_{2M}  \vdots  A_{N1}  A_{N2}  ...  A_{NM}       Output Print the number of codes among the given N codes that correctly solve this problem.        Sample Input 1 2 3 -10
1 2 3
3 2 1
1 2 2      Sample Output 1 1  Only the second code correctly solves this problem, as follows:   Since 3 \times 1 + 2 \times 2 + 1 \times 3 + (-10) = 0 \leq 0 , the first code does not solve this problem.  1 \times 1 + 2 \times 2 + 2 \times 3 + (-10) = 1 > 0 , the second code solves this problem.        Sample Input 2 5 2 -4
-2 5
100 41
100 40
-3 0
-6 -2
18 -13      Sample Output 2 2       Sample Input 3 3 3 0
100 -100 0
0 100 100
100 100 100
-100 100 100      Sample Output 3 0  All of them are Wrong Answer . Except yours.

Solution (Python):
if __name__ == '__main__':
    N, M, C = map(int, input().split())
    B = list(map(int, input().split()))
    A = [list(map(int, input().split())) for _ in range(N)]
    count = 0
    
    for i in range(N):
        S = 0
        for j in range(M):
            S += A[i][j]*B[j]
        if S + C > 0:
            count += 1
    
    print(count)

Solution (Python):
n,m,c = map(int,input().split())

b = list(map(int,input().split()))

ans = 0
for i in range(n):
  checkNum = 0
  a = list(map(int,input().split()))
  for j in range(m):
    checkNum += b[j] * a[j]
  if checkNum + c > 0:
    ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
for i in range(N):
    A.append(list(map(int, input().split())))

ans = 0
for i in range(N):
    tmp = 0
    for k in range(M):
        tmp += A[i][k] * B[k]
    if tmp > - C:
        ans += 1
print(ans)

Solution (Python):

import sys
def input():
	return sys.stdin.readline().strip()

N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A =[]
for i in range(N):
	A.append(list(map(int, input().split())))

total = 0
for i in range(N):
	num = C
	for j in range(M):
		num += A[i][j]*B[j]
	if num > 0:
		total += 1

print(total)

Solution (Python):
n,m,c = map(int,input().split())
b = [int(x) for x in input().split()]
ans = []
for _ in range(n):
    a = input().split()
    s = c
    for i in range(m):
        s += int(a[i])*b[i]
    ans += [s>0]
print(sum(ans))

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]
res = 0
for i in range(N):
  temp = C
  for j in range(M):
    temp += A[i][j] * B[j]
  if temp > 0:
    res += 1
print(res)

Solution (Python):
def dot(x, y):
  return sum([x[i]*y[i] for i in range(len(x))])

def Dot(A, b):
  return [dot(A[i], b) for i in range(len(A))]

n, m, c = map(int, input().split())
b = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(n)]
print(len(list(filter(lambda x: x+c>0, Dot(A, b)))))

Solution (Python):
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
ans=0
for i in range(n):
  temp=0
  A=list(map(int,input().split()))
  for a,b in zip(A,B):
    temp+=a*b
  if temp+c>0:
    ans+=1
print(ans)

Solution (Python):
cnt=0
n,m,c=map(int,input().split())
b=list(map(int,input().split()))

for i in range(n):
  sum=0+c
  a=list(map(int,input().split()))
  for j in range(m):
    sum+=a[j]*b[j]
  if sum>0:
    cnt+=1
print(cnt)

Solution (Python):
import numpy as np
n,m,c = map(int,input().split())
b=np.array(list(map(int,input().split())))
ans = 0
for _ in range(n):
  a = np.array(list(map(int,input().split())))
  if np.sum(a*b)+c >0:
    ans += 1
print(ans)

Solution (Python):
N,M,C = map(int,input().split())
B =list(map(int,input().split()))
ans = 0
sum = 0
for i in range(N):
    A = list(map(int,input().split()))
    for k in range(M):
        sum += A[k]*B[k]
    if sum + C > 0:
        ans += 1
    sum = 0
print(ans)

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = 0

for i in range(n):
  temp = 0
  for j in range(m):
    temp += a[i][j] * b[j]
  temp += c
  if temp > 0:
    ans += 1
print(ans)

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
B = list(map(int, input().split()))
B = np.array(B)
A = []
for n in range(N):
    a = list(map(int, input().split()))
    A.append(a)
A = np.array(A, dtype=int)
count = 0
for i in range(N):
  score = np.dot(A[i], B)
  if score > -C:
    count += 1


print(count)

Solution (Python):
n,m,c=map(int,input().split())
b=input().split()
a=[input().split()for _ in range(n)]
s=ans=0

for i in range(n):
  for j in range(m):
    s+=int(b[j])*int(a[i][j])

  s+=c
  if s>0:
    ans+=1
  s=0

print(ans)

Solution (Python):
n,m,c=map(int,input().split())

result=0



b=list(map(int,input().split()))

for _ in range(n):
  d=list(map(int,input().split()))
  temp=0
  for bb,dd in zip(b,d):
    temp+=bb*dd
  if temp+c>0:
    result+=1

print(result)

Solution (Python):
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
a = []
for l in range(N):
    a.append(list(map(int, input().split())))
res = 0
for s in a:
    left = C
    for i in range(0, M):
        left += s[i] * B[i]
    if left > 0:
        res += 1

print(res)

Solution (Python):
def func():
    N, M, C = map(int, input().split())

    B = list(map(int, input().split()))
    count = 0

    for _ in range(N):
        A = list(map(int, input().split()))
        sum = 0
        for i in range(M):
            sum += A[i] * B[i]

        if sum + C > 0:
            count += 1

    print(count)


if __name__ == '__main__':
    func()

Solution (Python):
N, M, C = map(int, input().split())
B_array = list(map(int, input().split()))
ans = 0
for _ in range(N):
	A_array = list(map(int, input().split()))
	sum = C
	for i in range(M):
		sum += B_array[i] * A_array[i]
	if sum > 0:
		ans += 1
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
l_a = [list(map(int, input().split())) for _ in range(n)]

res = 0
for a in l_a:
    s = c
    for x, y in zip(a, b):
        s += x * y
    if s > 0:
        res += 1
print(res)

Solution (Python):
import sys

N,M,C = map(int,input().split())

B = list(map(int,input().split()))

A = [ list(map(int,input().split())) for _ in range(N)]








num = 0
count = 0
for i in range(N):
    for j in range(M):
        num = num + B[j]*A[i][j]

    if ( (num + C) > 0): count = count + 1
    num = 0

print(count)

Solution (Python):
import numpy as np

n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = []
ans = 0
for i in range(n): 
    a.append(list(map(int,input().split())))
    if np.dot(a[i],b)+c > 0:
        ans += 1
print(ans)

Solution (Python):
def makelist(n, m):
    return [[0 for i in range(m)] for j in range(n)]

N, M, C = map(int, input().split())
B = [0] + list(map(int, input().split()))
ans = 0
for _ in range(N):
    acc = 0
    A = [0] + list(map(int, input().split()))
    for i in range(1, M+1):
        acc += A[i] * B[i]

    if acc + C > 0:
        ans += 1
print(ans)

Solution (Python):
def MAP(): return list(map(int,input().split()))

n,m,c = MAP()
b = MAP()
ans=0
for i in range(n):
    sm=0
    a = MAP()
    for j in range(m):
        sm += a[j]*b[j]
    if sm+c>0:
        ans+=1

print(ans)

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]

num = 0
for i in range(len(a)):
    ad = 0    
    for n in range(m):
        ad += a[i][n]*b[n]
    ad +=c
    if ad >0:
        num +=1
    else:
        pass
print(num)

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A =[list(map(int,input().split())) for i in range(N)]
ans = 0
for i in range(N):
    flag_AC = 0
    for j in range(M):
        flag_AC += A[i][j]*B[j]
    ans+= int(flag_AC+C>0)
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for k in range(n)]
 
count=0
 
for i in range(n):
  absum=0
  for j in range(m):
    absum +=a[i][j]*b[j]
   
  ans=absum+c
  if ans>0:
    count+=1
      
print(count)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[]
for i in range(n):
    a.append(list(map(int,input().split())))

qw=0
for i in range(n):
    ans=c
    for j in range(m):
        ans+=(b[j]*a[i][j])
    if ans>0:
        qw+=1

print(qw)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[list(map(int,input().split())) for k in range(n)]
 
count=0
 
for i in range(n):
       s=0
       for j in range(m):
        s += a[i][j]*b[j]
       
       ans=s+c
       if ans>0:
        count +=1
print(count)

Solution (Python):


def main():
    N, M, C = map(int, input().split())
    B = list(map(int, input().split()))
    A = [[] for _ in range(N)]
    for i in range(N):
        A[i] = list(map(int, input().split()))

    ans = 0
    for i in range(N):
        tmp = 0
        for j in range(M):
            tmp += A[i][j] * B[j]
        if tmp + C > 0:
            ans += 1

    return ans

if __name__ == '__main__':
    print(main())

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]

count = 0
for i in range(n):
    ab_sum = 0
    for j in range(m):
        ab_sum += a[i][j] * b[j]
    if ab_sum + c > 0:
        count += 1

print(count)

Solution (Python):
n, m, c = map(int,input().split())
*b, = map(int,input().split())
a = [list(map(int,input().split()))for _ in range(n)]
print(sum([1 if sum(x*y for x,y in zip(b,a[i])) + c > 0 else 0 for i in range(n)]))

Solution (Python):
import numpy as np
N,M,C=map(int, input().split())
B=np.array(list(map(int, input().split())))
c=0
for i in range(N):
  if np.dot(B,np.array(list(map(int, input().split()))))+C>0:
    c+=1
print(c)

Solution (Python):
import numpy as np
N,M,C=map(int, input().split())
B=np.array(list(map(int, input().split())))
A=[np.array(list(map(int, input().split()))) for _ in range(N)]
c=0
for i in range(N):
  if np.dot(B,A[i])+C>0:
    c+=1
print(c)

Solution (Python):



N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
tmp = 0
ctr = 0

for i in range(N):
    A = list(map(int, input().split()))
    for j in range(len(B)):
        tmp += A[j] * B[j]
    tmp += C
    if tmp > 0:
        ctr += 1
    tmp = 0
print(ctr)

Solution (Python):
"""
【ABC121】
B_Can_you_solve_this



import sys


def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def II(): return int(input())
def S(): return input()

N, M, C = MI()
B = LI()
cnt = 0
for i in range(N):
    sum = 0
    A = LI()
    for j in range(M):
        sum += A[j] * B[j]
    if sum + C > 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m,c = map(int,input().split())
B = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(n)]
ans = 0
for i in range(n):
  sum_i = c
  for j in range(m):
    sum_i += A[i][j]*B[j]
  if sum_i > 0:
    ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

ans = 0
for i in range(N):
    AB = [a*b for (a,b) in zip(A[i], B)]
    if sum(AB) + C > 0:
        ans += 1

print(ans)

Solution (Python):
n, m, c = map(int, input().split())
blst = list(map(int, input().split()))
cnt = 0
for i in range(n):
    judge = 0
    alst = list(map(int, input().split()))
    for j, k in zip(alst, blst):
        judge += j * k
    if judge + c > 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
for i in range(n):
  a = list(map(int, input().split()))
  p = c
  for k in range(m):
    p += a[k]*b[k]
  if p>0: count+=1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
c = 0
for i in range(N):
  A = list(map(int, input().split()))
  S = [A[j]*B[j] for j in range(M)]
  if sum(S)+C>0:
    c += 1
print(c)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
res = 0
for i in range(n):
    ans = sum([x*y for x,y in zip(b,list(map(int,input().split())))])
    if ans+c >0:
        res += 1
print(res)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
for _ in range(n):
    a = list(map(int, input().split()))
    if sum([x * y for x, y in zip(a[:], b[:])]) + c > 0:
        count += 1

print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0

for _ in range(N):
    A = list(map(int, input().split()))
    t = 0
    for a, b in zip(A, B):
        t += a * b
    if t + C > 0:
        ans += 1

print(ans)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split())
B = np.array([int(b) for b in input().split()])
A = []
for _ in range(N):
    A.append([int(a) for a in input().split()])

A = np.array(A)
print((np.dot(A, B) + C > 0).sum())

Solution (Python):
n,m,c=map(int, input().split())
b=list(map(int, input().split()))
count=0
for _ in range(n):
    a=list(map(int, input().split()))
    all_sum=c
    for i in range(m):
        all_sum+=a[i]*b[i]
    if all_sum>0:
        count+=1
print(count)

Solution (Python):
n, m, c = list(map(int ,input().split()))
b = list(map(int ,input().split()))
A = []
for i in range(n):
    A.append(list(map(int ,input().split())))
count = 0
for i in range(n):
    sum = 0
    for j in range(m):
        sum += (b[j] * A[i][j])
    if sum + c > 0:
        count += 1
print(count)

Solution (Python):
from operator import mul

N, M, C = map(int, input().split())
Blist = list(map(int, input().split()))
Alist = [list(map(int, input().split())) for _ in range(N)]

ans = 0
for a in Alist:
    if sum(map(lambda x: mul(*x), zip(a, Blist))) + C > 0:
        ans += 1

print(ans)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
count = 0
for i in range(n):
    a = list(map(int,input().split()))
    if sum(i*j for i,j in zip(a,b))+c>0: count+=1
print(count)

Solution (Python):
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for i in range(N)]

ans = 0
for i in range(N):
    tmp = 0
    for j in range(M):
        tmp += A[i][j]*B[j]
    tmp += C
    if tmp > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
count=0
for i in range(n):
    a=list(map(int,input().split()))
    ans=0
    for j in range(m):
        ans+=a[j]*b[j]
    if ans+c>0:
        count+=1
            
print(count)

Solution (Python):
def main():
    N, M, C = map(int, input().split())
    B = list(map(int, input().split()))

    cnt = 0
    for _ in range(N):
        A = list(map(int, input().split()))
        tmp = 0
        for i in range(M):
            tmp += A[i] * B[i]

        if tmp + C > 0:
            cnt += 1
        
    print(cnt)

main()

Solution (Python):
n, m, c = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0

for i in range(n):
  A = list(map(int, input().split()))
  S = 0
  for i in range(m):
    S += A[i] * B[i]
  if S + c > 0:
    cnt += 1
    
print(cnt)

Solution (Python):
import numpy as np

def main():
    N, M, C = map(int, input().split())
    b = np.array(list(map(int, input().split())))
    a = np.array([list(map(int, input().split())) for i in range(N)])

    count = 0
    for i in range(N):
        if np.sum(a[i]*b) + C > 0:
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
A = []
for i in range(N):
    A.append(list(map(int, input().split())))

ans = 0
for i in range(N):
    total = 0
    for j in range(M):
        total += A[i][j] * B[j]
    total += C
    if total > 0:
        ans += 1
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
ans = 0
for i in range(n):
  x = list(map(int, input().split()))
  tmp = c
  for j, k in zip(x, b):
    tmp += j*k
  if tmp > 0:
    ans += 1
print(ans)

Solution (Python):
import numpy as np

n, m, c = map(int, input().split())
B = np.array(list(map(int, input().split())))
count = 0

for i in range(n):
    A = np.array(list(map(int, input().split())))
    T = A * B
    if sum(T) + c > 0:
        count += 1

print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split())) 
A = [list(map(int, input().split())) for _ in range(N)] 

ans = 0

for i in range(N):
    number = C
    for j in range(M):
        number += A[i][j]*B[j]
    if number > 0:
        ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
Bs = list(map(int, input().split()))

cnt = 0
for i in range(N):
    As = list(map(int, input().split()))
    total = 0
    for j in range(M):
        total += Bs[j] * As[j]
    total += C
    if total > 0:
        cnt += 1
print(cnt)

Solution (Python):
import numpy as np

N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
A = []
for _ in range(N):
    A.append(list(map(int, input().split())))

amtx = np.array(A)
bvec = np.array(B)
score = np.count_nonzero(np.dot(amtx, bvec.T) > -C)
print(score)

Solution (Python):
N,M,C = [int(s) for s in input().split()]
B=[int(s) for s in input().split()]
ans=0
for i in range(N):
  A=[int(s) for s in input().split()]
  solve=0
  for i in range(M):
    solve+=A[i]*B[i]
  if solve+C>0:
    ans+=1
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

N,M,C = map(int,input().split())
B = list(map(int,input().split()))
A = [list(map(int,input().split())) for i in range(N)]
ans=0
for i in range(N):
    sum=0
    for j in range(M):
        sum+=A[i][j]*B[j]
    if sum+C>0:
        ans+=1
    
print(ans)

Solution (Python):
import numpy as np
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
ans=0
for i in range(n):
  A=list(map(int,input().split()))
  if np.dot(np.array(B),np.array(A))+c>0:
    ans+=1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
count=0
for i in range(n):
  a=list(map(int,input().split()))
  sum=0
  for j in range(m):
    sum=sum+b[j]*a[j]
  if sum+c>0:
    count=count+1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
count=0
for i in range(N):
    A = list(map(int, input().split()))
    SUM=0
    for j in range(M):
        SUM += A[j]*B[j]
    if SUM+C > 0:count += 1
print(count)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for i in range(N):
    A = list(map(int, input().split()))
    t = 0
    for m in range(M):
        t += A[m]*B[m]
    if t + C > 0:
        ans += 1
print(ans)

Solution (Python):
import numpy as np

N, M, C = map(int, input().split())
ans = 0
B = np.array(list(map(int, input().split())))
for i in range(N):
    A = np.array(list(map(int, input().split())))
    if np.sum(A * B) + C > 0:
        ans += 1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
a=[]
count=0
for i in range(n):
    a.append(list(map(int,input().split())))
for i in range(n):
    ab=0
    for j in range(m):
        ab+=a[i][j]*b[j]
    if ab+c>0:
        count+=1
print(count)

Solution (Python):
n, m, c = map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]

ans = 0
i = j = 0
for i in range(n):
    for j in range(m):
        a[i][j] = a[i][j]*b[j]
    if sum(a[i])+c > 0:
        ans+=1
print(ans)

Solution (Python):
import numpy as np
n,m,c = map(int,input().split())
b = np.array(list(map(int,input().split())))
ans = 0
for i in range(n):
  a = np.array(list(map(int,input().split())))
  if np.dot(a,b) > -c:
    ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
b = list(map(int, input().split()))
codes = [list(map(int, input().split())) for _ in range(N)]

res = 0
for code in codes:
    s = C
    
    for i in range(M):
        s += (code[i] * b[i])

    if s > 0:
        res += 1

print(res)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
a = [list(map(int,input().split())) for i in range(n)]
sum = 0
ac = 0

for i in range(n):
  for j in range(m):
    sum += a[i][j] * b[j]
  if sum + c > 0:
    ac += 1
  sum = 0

print(ac)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
ans = 0
for i in range(N):
    A = list(map(int, input().split()))
    t = 0
    for m in range(M):
        t += A[m]*B[m]
    if t + C > 0:
        ans += 1
print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
cnt = 0
for _ in range(n):
    a = list(map(int, input().split()))
    sum = c
    for i, j in zip(b, a):
        sum += i * j
    if sum > 0:
        cnt += 1
print(cnt)

Solution (Python):
from operator import mul

N,M,C = map(int,input().split())

B_list = list(map(int,input().split()))

ans = 0

for i in range(N):
  tmplist = list(map(int,input().split()))
  
  combined = list(map(mul,B_list,tmplist))

  if sum(combined)  + C > 0:
    ans += 1

print(ans)

Solution (Python):
n,m,c=map(int,input().split())
inputs=[list(map(int,input().split())) for _ in range(n+1)]
Bs=inputs[0]
As=inputs[1:]

ans=0
for a in As:
  total=0
  for i in range(m):
    total+=Bs[i]*a[i]
  if total+c>0:
    ans+=1
print(ans)

Solution (Python):
n,m,c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]
e=0
for i in range(n):
  d=0
  for j in range(m):
    d+=a[i][j]*b[j]
  if d+c>0:
    e+=1
print(e)

Solution (Python):
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
A = [list(map(int, input().split())) for _ in range(N)]

cnt = 0
for i in range(N):
    t = 0
    for p,q in zip(B, A[i]):
        t += p*q
    if t + C > 0:
        cnt += 1
print(cnt)

Solution (Python):
n,m,c = map(int,input().split())
b = list(map(int,input().split()))
check = 0
for i in range(n):
    d = 0
    A = list(map(int,input().split()))
    for j in range(m):
        d += b[j]*A[j]
    if d+c > 0:
        check += 1

print(check)

Solution (Python):
import sys
stdin = sys.stdin
import numpy as np
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

n, m, c = na()
b = np.array(na())
count = 0
for i in range(n):
    a = np.array(na())
    if np.sum(a * b) + c > 0:
        count += 1

print(count)

Solution (Python):
N,M,C = map(int,input().split())
B = [int(i) for i in input().split()]
A = [list(map(int,input().split())) for i in range(N)]
count = 0

for i in range(N):
    t = []
    for j in range(M):
        t.append(A[i][j]*B[j])
    if (sum(t)+C) > 0:
        count +=1
        
print(count)

Solution (Python):
N,M,C = map(int,input().split())
B = [int(i) for i in input().split()]
A = [list(map(int,input().split())) for i in range(N)]
count = 0
t = []
for i in range(N):
    for j in range(M):
        t.append(A[i][j]*B[j])
    if (sum(t)+C) > 0:
        count +=1
        t.clear()
    else:
        t.clear()
        
print(count)

Solution (Python):
N, M, C = map(int, input().rstrip().split())
B = [int(_) for _ in input().rstrip().split()]
A = [[int(_) for _ in input().rstrip().split()] for _ in range(N)]

ans = 0

for i in range(N):
    sum = C
    for j in range(M):
        sum += A[i][j] * B[j]
    if sum > 0:
        ans += 1

print(ans)

Solution (Python):
from numpy import array, sum
n, m, c = map(int, input().split())
B = array(list(map(int, input().split())))
s = 0
for _ in range(n) :
    A = array(list(map(int, input().split())))
    if sum(A*B)+c>0 : s += 1
print(s)

Solution (Python):
n,m,c = map(int,input().split())
b = [int(i) for i in input().split()]
flag = 0
for i in range(n):
    a = [int(j) for j in input().split()]
    sigma = 0
    for j in range(m):
        sigma = sigma + a[j]*b[j]
    sigma = sigma + c
    if sigma > 0:
        flag = flag + 1
print(flag)

Solution (Python):
import numpy as np
n, m, c = map(int, input().split())
B = np.array(list(map(int, input().split())))
A = np.array([list(map(int, input().split())) for _ in range(n)])
p = 0
for a in A:
    if np.dot(a, B)+c > 0: p += 1
print(p)

Solution (Python):
def main():
    N, M, C = map(int, input().split())
    B = [int(b) for b in input().split()]

    count = 0
    for i in range(N):
        v = C
        A = temp = [int(a) for a in input().split()]
        for j in range(M):
            v += A[j] * B[j]
        if v > 0: count += 1
    return count

if __name__ == '__main__':
    print(main())

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0
for i in range(N):
    A = list(map(int, input().split()))
    sum = 0
    for a, b in zip(A, B):
        sum += a*b
    sum += C
    if sum > 0:
        cnt += 1
print(cnt)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
a = [list(map(int, input().split())) for _ in range(n)]
ans = []

for i in a:
    add = c
    for j in range(m):
        add += i[j]*b[j]
    if add > 0:
        ans.append(add)

print(len(ans))

Solution (Python):
N,M,C = map(int,input().split())
B = list(map(int,input().split()))

ans = 0
for i in range(N):
    A = list(map(int,input().split()))
    t = 0
    for j in range(M): t += B[j]*A[j]
    if t + C > 0: ans += 1
print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
cnt = 0

for n in range(N):
    sum = C
    A = list(map(int, input().split()))
    for m in range(M):
        sum += A[m]*B[m]
    if sum > 0:
        cnt += 1

print(cnt)

Solution (Python):

N,M,C=map(int, input().split())
B=list(map(int, input().split()))
A=[]
S=C
x=0
for i in range(N):
    A.append(list(map(int, input().split())))
for i in range(N):
    S=C
    for v in range(M):
        S+=A[i][v]*B[v]
        if (v==M-1) and(S>0):
            x+=1
print(x)

Solution (Python):
n,m,c = map(int,input().split())
B = list(map(int,input().split()))
X = [[int(i) for i in input().split()] for _ in range(n)]
ans = 0
for i in range(n):
    ab = [a*b for a,b in zip(X[i],B)]
    j = sum(ab) + c
    if j > 0:
        ans += 1
    else:
        ans += 0
print(ans)

Solution (Python):
N,M,C= map(int,input().split())
B = list(map(int,input().split()))
ans = 0

for i in range(N):
    a = list(map(int,input().split()))
    s= C
    for j in range(M):
        s += a[j] * B[j]
    if s > 0:
        ans += 1

print(ans)

Solution (Python):
N, M, C = map(int, input().split())
B = [int(i) for i in input().split()]
A = []
for i in range(N):
  a = list(map(int, input().split()))
  A.append(a)

ans = 0
for i in range(N):
  t = C
  for j in range(M):
    t += A[i][j] * B[j]
  
  if t > 0:
    ans += 1

print(ans)

Solution (Python):
N,M,C = map(int,input().split())
Bn = list(map(int,input().split()))
ans=0
nums = []
for n in range(N):
    As = list(map(int,input().split()))
    if sum([x*y for (x,y) in zip(As,Bn)])+C>0:
        ans+=1
print(ans)

Solution (Python):
n,m,c=map(int,input().split())
b_list=list(map(int,input().split()))
List=[list(map(int,input().split())) for i in range(n)]

counter=0
for i in range(n):
    sum=0
    for j in range(m):
        sum+=b_list[j]*List[i][j]

    if sum+c>0:
        counter+=1

print(counter)

Solution (Python):
import numpy as np
N, M, C = map(int, input().split())
B = list(map(int, input().split()))

B = np.array(B).reshape(1, M)

count = 0

for i in range(N):
    A = list(map(int, input().split()))
    A = np.array(A).reshape(1, M)
    if np.dot(B, A.T)+C > 0:
        count = count + 1

print(count)

Solution (Python):
s = 0
def concat(a, b):
    res = 0
    for i in range(len(a)):
        res += a[i] * b[i]
    return res
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
for _ in range(N):
    A = list(map(int, input().split()))
    s += concat(A, B) + C > 0
print(s)

Solution (Python):
n,m,c=map(int,input().split())
B=list(map(int, input().split()))
ans=0
for _ in range(n):
    A=list(map(int, input().split()))
    t=c
    for i,j in zip(A,B):t+=i*j
    if t>0:ans+=1
print(ans)

Solution (Python):
import numpy as np
N, M, C= map(int, input().split()) 
B=np.array(list(map(int, input().split()) ))
A=np.array([list(map(int, input().split())) for _ in range(N)])
print(np.count_nonzero(np.dot(B, A.T)+C >0))

Solution (Python):
import numpy as np
n, m, c = (int(i) for i in input().split())
b = np.array([int(i) for i in input().split()])
a = np.array([[int(i) for i in input().split()] for i in range(n)])
ans = 0
for i in range(n):
    if sum(b*a[i]) + c > 0:
        ans += 1

print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b = list(map(int, input().split()))
count = 0
 
for i in range(n):
  a = list(map(int, input().split()))
  p = c
  for j in range(m):
  	p += a[j] * b[j]
  if 0 < p:
    count += 1
print(count)

Solution (Python):
N,M,C = map(int,input().split())
b_nums = [int(i) for i in input().split()]
count = 0
for j in range(N):
    a_nums = [int(k) for k in input().split()]
    eq = 0
    for m in range(M):
        eq += a_nums[m]*b_nums[m]
    if eq > -C:
        count += 1
print(count)

Solution (Python):
N, M, C = map(int, input().split())

B = list(map(int, input().split()))

ans = 0
for _ in range(N):
    A = list(map(int, input().split()))
    x = C
    for i in range(M):
        x += B[i] * A[i]
    if x > 0:
        ans += 1

print(ans)

Solution (Python):
N,M,C = map(int, input().split())
B = list(map(int, input().split()))
count = 0
for n in range(N):
    A = list(map(int, input().split()))
    total = C
    for a,b in zip(A,B):
        total += a*b
    if total > 0:
        count += 1
print(count)

Solution (Python):
n, m, c = map(int, input().split())
b = [int(inp) for inp in input().split()]
cnt = 0

for i in range(n) :
    sum = 0
    a = [int(inp) for inp in input().split()]
    for j in range(m) :
        sum += a[j] * b[j]
    if sum + c > 0 :
        cnt += 1

print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
count=0
for i in range(n):
  p=c
  A=list(map(int,input().split()))
  for j in range(m):
    p+=A[j]*B[j]
  if p>0:count+=1
print(count)

Solution (Python):
n,m,c=map(int,input().split())
B=list(map(int,input().split()))
a=0
for i in range(n):
    A=list(map(int,input().split()))
    x=0
    for j in range(m):
        x+=A[j]*B[j]
    if x+c>0:
        a+=1
print(a)

Solution (Python):
n, m, c = map(int, input().split())
b = [int(x) for x in input().split()]
ans = 0
for i in range(n):
    a = [int(x) for x in input().split()]
    key = c
    for j in range(m):
        key += a[j]*b[j]
    if key > 0:
        ans += 1
print(ans)