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

Solution (Python):
N,M,C = (int(X) for X in input().split())
B = [int(X) for X in input().split()]
Count = 0
for T in range(0,N):
    A = [int(X) for X in input().split()]
    if sum([X*Y for X,Y in zip(A,B)])+C>0:
        Count += 1
print(Count)

Solution (Python):
n,m,c=input().split(" ")
cnt=0
n,m,c=int(n),int(m),int(c)
lst=[]
for i in range(n+1):
  lst.append(input().split(" "))

for i in range(1,n+1):
  ans=c
  for j in range(m):
    ans+=int(lst[i][j])*int(lst[0][j])
  if ans>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 = 0
for X in A:
  y = C
  for a, b in zip(X, B):
    y += a * b
  if y > 0:
    ans += 1
print(ans)

Solution (Python):
import sys
import numpy as np
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))

n, m, c = rm()
b = np.array(rl())
cnt = 0
for _ in range(n):
  a = np.array(rl())
  if np.sum(a*b) > -c:
    cnt += 1
print(cnt)

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7

n, m, c = rm()
b = np.array(rl())
cnt = 0
for _ in range(n):
  a = np.array(rl())
  if np.sum(a*b) > -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):
    A=list(map(int,input().split()))
    if sum([a*b for (a,b) in zip(A,B)])+C>0:
        ans+=1
    
print(ans)

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

ans = 0
for i in range(N):
    temp = C
    for j in range(M):
        temp += A[i][j] * B[j]
    if temp > 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):
  li = [c]
  a = list(map(int,input().split(" ")))
  for x, y in zip(a,b):
    li.append(x*y)
  li_sum = sum(li)
  if li_sum > 0:
    count += 1
print(count)

Solution (Python):

N,M,C = map(int,input().split())
Bn = list(map(int,input().split()))
Sum,cou= 0,0

for i in range(N):
    An = list(map(int,input().split()))
    Sum = 0
    for j in range(M):
        Sum += An[j]*Bn[j]
        
    if Sum+C>0:
        cou += 1
        
print(cou)

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

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

print(t)

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):
import math

def main():

    n,m,c = list(map(int, input().split()))
    b = list(map(int, input().split()))
    aii = [input().split() for l in range(n)]
    cnt = 0
    
    for i in range(n):
        aa = aii[i]
        a_sum = 0
        for ii in range(m):
            a_sum += int(aa[ii])*b[ii]
        a_sum += c
        if a_sum > 0:
            cnt += 1
    print(cnt)
if __name__ == "__main__":
    main()

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

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

Solution (Python):
import sys
def IL(): return map(int,sys.stdin.readline().rstrip().split())

def Main():
    n,m,c = IL()
    b = list(IL())
    ans = 0
    for _ in range(n):
        a = list(IL())
        tmp = 0
        for i in range(m):
            tmp += b[i]*a[i]
        if -c<tmp: ans += 1
    print(ans)
    return

if __name__=='__main__':
    Main()

Solution (Python):
N, M, C = (int(x) for x in 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()]
  P = C
  for j in range(M):
    P += A[j]*B[j]
  if P > 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()))
    s = C
    for j in range(M):
        s += A[j] * B[j]
    if s > 0:
        cnt += 1
print(cnt)

Solution (Python):
from sys import stdin
def main():
    
    readline=stdin.readline
    n,m,c=map(int,readline().split())
    b=list(map(int,readline().split()))
    a=[list(map(int,readline().split())) for _ in range(n)]

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

if __name__=="__main__":
    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)]
t = C
ans = 0
for i in range(N):
    for j in range(M):
        t += A[i][j] * B[j]
    if t > 0:
        ans += 1
    t = C
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(((A * B).sum(axis=1) + c > 0).sum())

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())))
    if np.sum(A * B) + c > 0:
        count += 1
print(count)

Solution (Python):
N, M, C = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 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:
        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 n in range(N)]

cnt = 0
for a in A:
    calc = 0
    for m in range(M):
        calc += a[m] * B[m]
    if calc + C > 0:
        cnt += 1

print(cnt)

Solution (Python):
n,m,c=map(int,input().split())
b=list(map(int, input().split()))
res = 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:
        res +=1
print(res)

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

ans = 0

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

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

ans=((A*B).sum(axis=1)+C>0).sum()
print(ans)

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

Solution (Python):
def main():
    n, m, c = map(int, input().split())
    blis = list(map(int, input().split()))
    alis = []
    for i in range(n):
        ilis = list(map(int, input().split()))
        alis.append(ilis)
    ans = 0
    for i in range(n):
        tmp = c
        for k in range(m):
            
            tmp += alis[i][k] * blis[k]
        if tmp > 0:
            ans += 1
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
def resolve():
    '''
    code here
    '''
    N, M, C = [int(item) for item in input().split()]
    Bs = [int(item) for item in input().split()]

    grid = [[int(item) for item in input().split()] for _ in range(N)]

    cnt = 0

    for i in range(N):
        temp = C
        for j in range(M):
            temp += grid[i][j]*Bs[j]
        if temp > 0:
            cnt += 1

    print(cnt)

if __name__ == "__main__":
    resolve()

Solution (Python):
import numpy as np

N,M,C = map(int, input().split())
B = np.array(input().split(), int)
As = np.array([input().split() for _ in range(N)], int)

ans = 0
for A in As:
    if np.dot(B, A) + 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())))
As = [np.array(list(map(int, input().split()))) for _ in range(N)]

ans = 0
for A in As:
    if np.dot(B, A) + C > 0:
        ans += 1
print(ans)

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

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

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

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

total=0
for v in a:
    combined1=[x*y for (x,y) in zip(b,v)]
    if sum(combined1)+c > 0:
        total+=1
print(total)

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

for n in range(N):
  A = list(map(int,input().split()))
  if 0<sum([a*b for a,b in zip(A,B)])+C:
    a+=1

print(a)

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)]
t = 0
def judge(x):
  s = 0
  for i in range(M):
    s += B[i]*x[i]
  s += C
  if s>0:
    return 1
  else:
    return 0
for a in A:
  t = t + judge(a)
print(t)

Solution (Python):
N, M, C = map(int, input().split())
B = list(map(int, input().split()))
solved = 0
for _ in range(N):
  evalue = C
  for A_i, B_i in zip(map(int, input().split()), B):
    evalue += A_i * B_i
  solved += 1 if evalue > 0 else 0
print(solved)

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

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

ans = 0
for _ in range(N):
    A = list(map(int, input().split()))

    score = 0
    for a,b in zip(A,B):
        score += a*b
    
    if score + C > 0:
        ans += 1

print(ans)

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

    for i in range(N):
        calc = 0
        A = list(map(int, input().split()))
        for j in range(len(A)):
            calc += A[j] * B[j]
        if calc + 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()))
    tmp = 0
    for j in range(m):
        tmp += a[j]*b[j]
    if tmp + c > 0:
        cnt += 1

print(cnt)

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

Solution (Python):
def f(A,B,C,M):
    X=C
    for i in range(M):
        X+=A[i]*B[i]
    return X

K=0
N,M,C=map(int,input().split())
B=list(map(int,input().split()))
for _ in range(N):
    A=list(map(int,input().split()))
    K+=f(A,B,C,M)>0
print(K)

Solution (Python):
n, m, c = map(int, input().split())
blst = list(map(int, input().split()))
res = 0
for i in range(n):
  temp = c
  alst = list(map(int, input().split()))
  for j in range(m):
    temp += (alst[j] * blst[j])
  if temp > 0:
    res += 1
print(res)

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

bl = list(map(int,input().split()))
al = []
for i in range(N):
    al.append(list(map(int,input().split())))

cnt = 0
for i in range(N):
    wa = 0
    for j in range(M):
        wa += al[i][j]*bl[j]
    if wa + C > 0:
        cnt += 1

print(cnt)

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

out = 0
for i in range(n):
    smpr = 0
    for j in range(m):
        smpr += A[i][j] * B[j]
    if smpr + c > 0:
        out += 1
print(out)

Solution (Python):












import sys
def p(*_a):
  
  _s=" ".join(map(str,_a))
  
  sys.stderr.write(_s+"\n")

yn = lambda b: print('Yes') if b else print('No')

N,M,C = map(int, input().split())
B = [int(i) for i in input().split()]
AA = [[int(i) for i in input().split()] for _ in range(N)]

p(B)
p(AA)

ans = 0
for A in AA:
  x = C
  for a,b in zip(A,B):
     x += a * b

  if x > 0: ans += 1

print(ans)

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

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 8)
from itertools import accumulate
from itertools import permutations
from itertools import combinations
from collections import defaultdict
from collections import Counter
import fractions
import math
from collections import deque
from bisect import bisect_left
from bisect import bisect_right
from bisect import insort_left
import itertools
from heapq import heapify
from heapq import heappop
from heapq import heappush
import heapq
from copy import deepcopy
from decimal import Decimal
alf = list("abcdefghijklmnopqrstuvwxyz")
ALF = list("ABCDEFGHIJKLMNOPQRSTUVWXYZ")

INF = float("inf")


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

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

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

for i in range(N):
  a = np.array(list(map(int, input().split())))
  result = np.dot(a, b) + C
  if result > 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)]

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

print(cnt)

Solution (Python):

import numpy as np
import sys
input = sys.stdin.readline
N,M,C = (int(i) for i in input().split())
B = list(map(int, input().split()))
B =np.array(B,dtype=int)
A =np.zeros((N,M),dtype=int)
for i in range(N):
    A[i] = list(map(int, input().split()))
    

count =0
for i in range(N):
    if np.sum(A[i] *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 _ in range(N)]
count = 0
for a in A:
    ans = 0
    for i in range(M):
        ans += a[i] * B[i]
    if ans + C > 0:
        count += 1
print(count)

Solution (Python):
def resolve():
    N,M,C = map(int,input().split())
    *B, = map(int,input().split())
    count=0
    for i in range(N):
        A = map(int,input().split())
        if sum(map(lambda x,y:x*y,A,B))+C>0:
            count+=1
    print(count)

resolve()

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

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

N, M, C = I()
que = []
B = l()
A = []
for i in range(N):
    a = l()
    A.append(a)

count = 0
for i in range(N):
    ans = 0
    for j in range(M):
        ans += A[i][j]*B[j]
    ans += C
    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)]
cnt = 0
for j in range (n):
  ans = 0
  for k in range (m):
    ans += a[j][k]*b[k]
  if ans+c > 0:
    cnt += 1
print(cnt)

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

Solution (Python):









import os
import sys




def main():
    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()))
        total = sum(a[i]*b[i] for i in range(m))+c
        if total>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 = [list(map(int, input().split())) for _ in range(n)]
vecprod = [0] * n
for i,ln in enumerate(a):
    s = 0
    for j in range(m):
        s += ln[j] * b[j]
    vecprod[i] = s
vecprod = [1 if x + c > 0 else 0 for x in vecprod]
print(sum(vecprod))

Solution (Python):
N, M, C = input().split(' ')
N = int(N)
M = int(M)
C = int(C)
B = []
B = input().split(' ')
B = [int(i) for i in B]
A = []
R = 0
for i in range(N):
  A = input().split(' ')
  A = [int(i) for i in A]
  combine = [x * y for (x, y) in zip(A, B)]
  if sum(combine) + C > 0:
    R += 1
print(R)

Solution (Python):
(n, m, c), bb, *aaa = [list(map(int, l.split())) for l in open(0)]

ans = 0

print(sum((sum(b*a for b, a in zip(bb, aa))+c>0) for aa in aaa))

Solution (Python):










N, M, C = map(int, input().split())
list_B = list(map(int, input().split()))
ans = 0
for Ni in range(N):
    list_A = list(map(int, input().split()))
    temp = 0
    for Mi in range(M):
        temp += list_A[Mi]*list_B[Mi]
    temp = temp + C
    if temp > 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=list(map(int,input().split()))
ans=0
for i in range(n):
    a=list(map(int,input().split()))
    num=0
    for l in range(m):
        num+=a[l]*b[l]
    if num+c>0:
        ans+=1
print(ans)

Solution (Python):
import numpy as np

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

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

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

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()))
    cnt = c
    for i in range(m):
        cnt += A[i] * B[i]
          
    if cnt > 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()))
  total = c
  for j, (a_temp,b_temp) in enumerate(zip(a,b)):
    total += a_temp * b_temp
  if total >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)]
cnt = 0

for l in a:
    tmp = 0
    for i in range(m):
        tmp += b[i]*l[i]
    tmp += c
    if tmp > 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(0,N,1):
    tmp=C
    for j in range(0,M,1):
        tmp+=A[i][j]*B[j]
    if tmp > 0:
        ans+=1
print(ans)

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

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

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

ok_count = 0
for _ in range(N):
    A = list(map(int, input().split()))
    total = 0
    for a, b in zip(A, B):
        total += a * b
    total += C
    if total > 0:
        ok_count += 1
print(ok_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()))
    X = []
    for j in range(M):
        X.append(A[j]*B[j])
    if sum(X) + C > 0:
        ans += 1

print(ans)

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


correct = 0
for N_iter in range(N):
    line_sum = 0
    for M_iter in range(M):
        line_sum += int(A[N_iter][M_iter])*B[M_iter]
    line_sum += C
    if line_sum > 0:
        correct += 1

print(correct)

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

print(ans)

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

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

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

Solution (Python):

N,M,C = map(int, input().split())
cnt = 0
b = list(map(int,input().split()))

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:
        cnt += 1
    else:
        pass

print(cnt)

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

r = 0

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

print(r)

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

def main(n,m,a,b,c):
    seikai=0
    for i in range(n):
        sum=0
        for j in range(m):
            sum+=a[i][j]*b[j]
        sum+=c
        if sum > 0:
            seikai+=1
    return seikai

if __name__=='__main__':
    n,m,a,b,c=readinput()
    ans=main(n,m,a,b,c)
    print(ans)

Solution (Python):
import numpy as np

n, m, c = list(map(int, input().split()))
b = np.matrix(list(map(int, input().split())))
a = np.matrix([list(map(int, input().split())) for i in range(n)])
res = int(sum([i > 0 for i in a * b.T + c])[0, 0])
print(res)

Solution (Python):
n,m,q = map(int, raw_input().split(' ')) 
bis = map(int, raw_input().split(' '))
c = 0
for _ in range(n):
	if sum([u*v for u,v in zip(map(int,raw_input().split(' ')),bis)]) + q > 0:
		c+=1
print c

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

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

Solution (Python):
def main():
    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 x in a:
        C = c
        for i in range(m):
            C += x[i]*b[i]
        if C > 0:
            ans += 1
    print(ans)
    
if __name__ == "__main__":
    main()

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

passed = 0
for i in range(N):
    num = 0

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

    if num > 0:
        passed += 1

print(passed)

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


if __name__ == '__main__':
    solve()

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

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

print(ans)

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