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):
n,m,c = list(map(int, input().split()))
Bs = list(map(int, input().split()))
As =[]
for i in range(n):
	As.append(list(map(int, input().split())))

def check(alist,blist, c):
	num = 0
	for jj in range(len(alist)):
		num += alist[jj] * blist[jj]
	num += c
	return num
cnt = 0
for i in range(n):
	ans = check(As[i],Bs, c)
	if ans > 0:
		cnt += 1
print(cnt)

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

print(count)

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

count = 0
for _ in range(N):
    src = list(map(int,input().split()))
    Y = np.array(src)
    if np.dot(X,Y)+C > 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)]
for i in range(n):
    a[i] = list(map(int,input().split()))
    
cnt=0

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

Solution (Python):



n, m, c = list(map(int, input().split()))
b_list = list(map(int, input().split()))
a_list_list = []

for _ in range(n):
    a_list = list(map(int, input().split()))
    a_list_list.append(a_list)

count = 0

for a_list in a_list_list:
    total = sum([a * b for a, b in zip(a_list, b_list)]) + c
    if total > 0:
        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()))
    ab = [aa*bb for aa,bb in zip(a,b)]
    if (sum(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 _ in range(n)]
s=[0]*n

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

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 j in range(m):
        t += a[i][j] * b[j]
    if t + 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()))
	tokuten = 0
	for j in range(m):
		tokuten += b[j]*a[j]
	if tokuten > -c:
		count += 1

print(count)

Solution (Python):

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

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

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

Solution (Python):
import numpy as np

n, m, c = map(int, input().split(' '))
b = np.array(list(map(int, input().split(' '))))
cnt = 0
for _ in range(n):
    a = np.array(list(map(int, input().split(' '))))
    if a.dot(b) + c > 0:
        cnt += 1
print(cnt)

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

ans = 0
for i in range(n):
    point = c
    for j in range(m):
        point += a[i][j]*b[j]
    if point > 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):
    a = list(map(int, input().split()))
    d = c
    for j in range(m):
        d += a[j] * b[j]
    if (d > 0):
        ans += 1
print(ans)

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 low in range(n):
    Sum = c
    for col in range(m):
        Sum += A[low][col]*B[col]

    if Sum > 0:
        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()))
  p=C
  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()))
ans = 0
for i in range(N):
    tmp = list(map(int, input().split()))
    tmp2 = 0
    for j in range(M):
        tmp2 += tmp[j] * B[j]
    tmp2 += C
    if tmp2 > 0:
        ans += 1
print(ans)

Solution (Python):
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())))

ans = 0
for h in range(n):
  if sum([a[h][i] * b[i] for i in range(m)]) + 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())))
A = []
for i in range(N):
  A.append(list(map(int,input().split())))
A = np.array(A)
print(sum(x+C>0 for x in sum((B*A).T)))

Solution (Python):
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
a=[]
x=0
for i in range(N):
  A=list(map(int,input().split()))
  for h in range(M):
    x+=A[h]*B[h]
  sum=x+C
  if sum>0:
    a.append(sum)
  sum=0
  x=0
  A=[]
print(len(a))

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

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

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

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

def prod(a,b,init=0):
  total=init
  for a_,b_ in zip(a,b):
    total+=a_*b_  
  return total

cnt=0
for i in range(n):
  a=list(map(int,input().split()))
  if 0 < prod(a,b,init=c):
    cnt+=1
print(cnt)

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()))
  total=0
  for a_,b_ in zip(a,b):
    total+=a_*b_
  if 0 < total+c:
    cnt+=1
print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
ans=0
for i in range(n):
  s=0
  a=list(map(int,input().split()))
  for j in range(m):
    s+=a[j]*b[j]
  if s+c>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):
  a=list(map(int,input().split()))
  s=0
  for j in range(m):
    s+=a[j]*b[j]
  if s+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 _ in range(n)]
ans = 0
for a in A:
    tmp = 0
    for i in range(m):
        tmp += a[i] * B[i]
    tmp += c
    if tmp > 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)]


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


print(ans)

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 = sum([_a*_b for _a, _b in zip(a, b)]) + c
    if _sum > 0:
        cnt += 1
print(cnt)

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

Solution (Python):
n,m,c=map(int, input().split())
B=[int(x) for x in input().split()]

sum=0
count=0

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

print(count)

Solution (Python):
def solve():
    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 data in a:
        num = sum([ai * bi for ai, bi in zip(data, b)]) + c
        if num > 0:
            count += 1
    return count


if __name__ == "__main__":
    print(solve())

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) ]

totalcol = 0
for n in range(N):
    ex = sum([ A[n][m] * B[m] for m in range(M) ])
    ex += C
    totalcol += (ex > 0)

print(totalcol)

Solution (Python):
import math
import copy

inputa = input().split()



a = int(inputa[0])
b = int(inputa[1])
c = int(inputa[2])

inputb = input().split()
inputbint = [int(x) for x in inputb]





inputList=[]
for i in range(a):
    inputNum = input().split()
    inputNum = [int(x) for x in inputNum]
    inputList.append(inputNum)






cnt = 0
sum = 0
for i in range(a):
    sum = c
    for j in range(len(inputbint)):
        sum += inputbint[j]*inputList[i][j]
    if sum > 0:
        cnt += 1

print(cnt)

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

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

print(d)

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()))
    if sum([x*y for x,y in zip(a,b)])+c>0:cnt+=1
print(cnt)

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

list = [input() for _ in range(N)]

count = 0
for l in list:
  sum = 0
  for index, num in enumerate(l.split()):
    sum += int(num) * B[index]
  sum += C
  if sum > 0:
    count += 1
print(count)

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

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

print(ans)

Solution (Python):



def solve(N, M, C, B, A):
    ans = 0
    for Ai in A:
        if sum(Aij * Bi for Aij, Bi in zip(Ai, B)) + C > 0:
            ans += 1
    return ans


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

    ans = solve(N, M, C, B, A)
    print(ans)

Solution (Python):
n, m, c = map(int, input().split())
b_l = list(map(int, input().split()))
ans = []
for i in range(n):
    a_l = list(map(int, input().split()))
    if sum(a*b for a, b in zip(a_l, b_l)) + c > 0:
        ans.append(i)
print(len(ans))

Solution (Python):
import numpy as np

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

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

count = 0
for i in range(N):
    hantei = C
    for j in range(M):
        hantei += int(A[i][j]) * B[j]
    if hantei > 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)]

cnt = 0
for i in a:
  if sum([j * k for j, k in zip(i, b)]) + c > 0:
    cnt += 1
print(cnt)

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

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

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

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]
    ans = ans + c
    if ans > 0:
        count+= 1
print(count)

Solution (Python):
n, m, c = map(int, input().split())
bL = list(map(int, input().split()))
ans = 0
for i in range(n):
    aL = list(map(int, input().split()))
    sum_ab = 0
    for j in range(m):
        sum_ab += aL[j]*bL[j]
    if sum_ab > (-1)*c:
        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)]
cnt = 0
for i in range(n):
  cc = 0
  for j in range(m):
    cc += b[j]*a[i][j]
  if cc + c > 0:
    cnt += 1
print(cnt)

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 in range(M):
    sum += A[i] * B[i]
  if sum > 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(0, n):
    a = list(map(int, input().split()))
    s = 0
    for j in range(0, m):
        s += a[j] * b[j]
    if s + c > 0:
        count += 1
print(count)

Solution (Python):
import numpy as np
n,m,c = map(int,input().split())
bl = list(map(int,input().split()))
count = 0
for _ in [0]*n:
  al = list(map(int,input().split()))
  if np.dot(al,bl)+c > 0:
    count+=1
print(count)

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

import numpy as np
A = np.zeros((N,M))
B = list(map(int, input().split()))

for i in range(N):
  A[i] = list(map(int, input().split()))
D = np.dot(A, B) + C
cnt = 0
for i in range(N):
  if D[i] > 0: cnt+= 1
print (cnt)

Solution (Python):
n,m,c = map(int,input().split())
a = input().split()
a = [int(x) for x in a]
     
d = 0
e = 0
for i in range(n):
    b = input().split()
    b = [int(x) for x in b]
    for j in range(m):
        d += b[j]*a[j]
        
    if d + c >0:
        e += 1
    d = 0
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)]

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

print(ans)

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

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

print(answer)

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):
    calc = 0
    for j in range(m):
        calc += a[i][j] * b[j]
    if calc + c <= 0:
        pass
    else:
        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)]

cnt = 0
for i in A:
    tmp = 0
    for m, n in zip(B, i):
        tmp += m*n
    if tmp + C > 0:
        cnt += 1

print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int,input().split()))
def sol(x,y,z):
  l=len(y)
  par=0
  for i in range(l):
    par+=x[i]*y[i]
  if(par+z>0):
    return 1
  else:
    return 0

ans=0
for i in range(n):
  a=list(map(int,input().split()))
  ans += sol(a,b,c)
print(ans)

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

cnt=0

for i in range(n):
  total = 0
  
  a = list(map(int,input().split()))
  
  for j in range(m):
    total += a[j] * b[j]

  if total > -c:
    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)]
count=0
for j in range(N):
	if sum((A[j][k])*(B[k]) for k in range(M))+C>0:
		count=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):
    temp = list(map(int, input().split()))
    a.append(temp)


count = 0

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

    if ans > 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):
    temp=0
    for j in range(M):
        temp += A[i][j]*B[j]
    if temp+C>0:
        ans +=1
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
n,m,c=map(int,input().split())
ans=0
b=list(map(int,input().split()))

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
        else:
                continue
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()))
    check = 0
    for j in range(m):
        check += a[j] * b[j]
    if check + c > 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):
  A = list(map(int, input().split()))
  sum = C
  for j in range(M):
    sum += A[j] * B[j]
  if sum > 0:
    ans += 1
print(ans)

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

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()))
    d = c
    for j in range(m):
        d += b[j]*a[j]
    if d>0:
        ans += 1

print(ans)

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

print(d)

Solution (Python):

n, m, c = map(int, input().split())
Bs = list(map(int, input().split()))
count = 0
for i in range(n):
    As = list(map(int, input().split()))
    if sum(map(lambda a, b: (a*b), Bs, As)) > -c:
        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()))
    temp = c
    for j in range(m):
        temp += a[j] * b[j]
    if temp > 0:
        count += 1
print(count)

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 sum(A*B)+C>0:
        ans=ans+1
print(ans)

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()))
    total = 0
    for i in range(m):
        total += a[i] * b[i]
    total += c
    if total > 0:
        ans += 1
print(ans)

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

a = 0
ans = 0

for i in range(N):
	a = 0
	A = [int(i) for i in input().split()]
	for g in range(M):
		a += A[g]*B[g]
	if a+C>0:
		ans+=1
print(ans)

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

for j in range(n):
  sum=0
  A=list(map(int,input().split()))
  
  for i in range(m):
    sum+=A[i]*B[i]
  
  sum+=c
  
  if sum>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()))
    x = C + sum([A[i] * B[i] for i in range(M)])
    if x > 0:
        ans += 1
print(ans)

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

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()))
    total = 0
    for j in range(m):
        total += (b[j] * a[j])
    if total + c > 0:
        cnt += 1
print(cnt)

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

Solution (Python):
import numpy as np
n, m, c = map(int, input().split())
b_row  = np.array(list(map(int, input().split())))
a_rows = np.array([list(map(int, input().split())) for i in range(n)])




ans_count = 0
for a_row in a_rows:
    
    if sum(a_row * b_row) + c > 0:
        ans_count += 1

print(ans_count)

Solution (Python):
import numpy as np

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

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

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

Solution (Python):
import numpy as np
 
Tmp = []
Tmp = input().rstrip().split(' ')
 
nN = int(Tmp[0])
nM = int(Tmp[1])
nC = int(Tmp[2])
nAns = 0
ListA = [0 for i in range(nM)]
ListB = [0 for i in range(nM)]
Tmp = input().rstrip().split(' ')
for i in range(nM):
  ListB[i] = int(Tmp[i])
nAns = 0
 
for i in range(nN):
  Tmp = input().rstrip().split(' ')
  for j in range(nM):
    ListA[j] = int(Tmp[j])

    

  nTmp = 0
  for j in range(nM):
    nTmp += ListA[j] * ListB[j]
  nTmp += nC
  if nTmp > 0:
    nAns += 1

print(nAns)

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

for i in range(n):
    a.append(list(map(int, input().split())))

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

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

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(' ')))
    if sum([x * y for x, y in zip(a, B)]) + C > 0:
        ans += 1
print(ans)

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

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

Solution (Python):


from collections import deque

def resolve():
    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()))
        v = 0
        for j in range(m):
            v += a[j] * b[j]
        v += c
        if v > 0:
            ans += 1
    print(ans)

if __name__ == "__main__":
    resolve()

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

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

Solution (Python):

import sys


def get_num():
    return int(input())


def get_nums(n):
    res = [0 for _ in range(n)]
    for i in range(n):
        res[i] = int(input())
    return res


def get_numbers():
    return map(int, input().split())

n, m, c = get_numbers()
b = list(get_numbers())

ans = 0
for _ in range(n):
    a = list(get_numbers())
    res = c
    for i, j in zip(a, b):
        res += i * j
    if res > 0:
        ans += 1

print(ans)

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

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

print(an)

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]
  else:
    if sum + C > 0:
      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()))
    li = []
    for j in range(m):
        li.append(a[j]*b[j])
    if sum(li) + c > 0:
            count += 1
print(count)

Solution (Python):
n, m, c = list(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):
    code_num = 0
    for j in range(m):
        code_num += b[j] * a[i][j]
    code_num += c
    if code_num > 0:
        ans += 1
print(ans)

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

right=0

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

print(right)

Solution (Python):

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

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

sum = 0
count = 0

for i in range(n):
    array = list(map(int, input().split()))
    a.append(array)

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


print(count)

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 j in range(m):
    sum += (a[j]*b[j])
  sum += c
  if sum > 0:
    cnt += 1
  else:
    pass
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()))
    eq = c
    for j in range(m):
        eq += a[j] * b[j]
    if eq > 0:
        count += 1
print(count)

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

Solution (Python):
str_in = input().split()
num = int(str_in[0])
m   = int(str_in[1])
c   = int(str_in[2])

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

cnt = 0
for i in range(num):
  list_a = input().split()
  list_a = list(map(int, list_a))
  
  trial = c
  for j in range(m):
    trial += list_a[j] * list_b[j]
  if (trial > 0):
    cnt += 1

print (cnt)

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())))
cnt=0
for i in range(n):
    ab=0
    for j in range(m):
        ab+=a[i][j]*b[j]
    if ab+c>0:
        cnt+=1
print(cnt)

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

Solution (Python):
import numpy as np

N,M,C = map(int,input().split())
B = np.array(list(map(int,input().split()))+[C])

A_list = np.zeros((N,M+1))
for i in range(N):
  A_list[i,:] = np.array(list(map(int,input().split()))+[1])

cnt=0
for i in range(N):

  if sum(A_list[i,:]*B)>0:
    cnt+=1
print(int(cnt))