Harryxun/stf_run huggingface dataset:
n, k = input().split()
n = int(n)
k = int(k)
p = list(map(int, input().split()))
q = [p[0]]
for i in range(n-1):
	q.append(q[i]+p[i+1])
r = []
for i in range(n-k):
	r.append(q[i+k]-q[i])
r.sort()
print((r[n-k-1]+k)/2)

### FIXED CODE ###

n, k = input().split()
n = int(n)
k = int(k)
p = list(map(int, input().split()))
if n==k:
	print((sum(p)+n)/2)
else:
	q = [p[0]]
	for i in range(n-1):
		q.append(q[i]+p[i+1])
	r = []
	for i in range(n-k):
		r.append(q[i+k]-q[i])
	r.sort(reverse=True)
	print((r[0]+k)/2)
from itertools import permutation
N,M=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(M)]
g=[[False]*N for i in range(N)]
for a,b in ab:
  g[a-1][b-1]=True
  g[b-1][a-1]=True
nodes=[i for i in range(N)]
ans=0
for route in permutation(nodes):
  for i in range(N):
    if i == N-1:
      ans+=1
      break
    if g[route[i]][route[i+1]]:
      continue
    else:
      break
print(ans)
      
    
    

### FIXED CODE ###

from itertools import permutations
N,M=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(M)]
g=[[False]*N for i in range(N)]
for a,b in ab:
  g[a-1][b-1]=True
  g[b-1][a-1]=True
nodes=[i for i in range(1,N)]
ans=0
for route in permutations(nodes):
  if g[0][route[0]]== False:
    continue
  for i in range(N-1):
    if i == N-2:
      ans+=1
      
      break
    elif g[route[i]][route[i+1]]:
      continue
    else:
      break
print(ans)
from functools import lru_cache


@lru_cache(maxsize=None)
def popcount(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    x = x + (x >> 64)
    return x & 0x0000007f


@lru_cache(maxsize=None)
def rec(n):
    if n == 0:
        return 0
    else:
        return rec(n % popcount(n)) + 1


n = int(input())
arr = input()

li = []

for i in range(n):
    tmp = arr[:i] + str(1 ^ int(arr[i])) + arr[i + 1:]
    li.append(int(tmp, 2))

for x in li:
    print(rec(x))

### FIXED CODE ###

from functools import lru_cache


def popcnt(x):
    return bin(x).count("1")


@lru_cache(maxsize=None)
def rec(n):
    if n == 0:
        return 0
    else:
        return rec(n % popcnt(n)) + 1


ret = [rec(x) for x in range(2 * 10**5 + 1)]


n = int(input())
arr = input()

ALL_ARR = int(arr, 2)

cnt = popcnt(int(arr, 2))
init_big = ALL_ARR % (cnt + 1)
if cnt == 1:
    init_small = 0
else:
    init_small = ALL_ARR % (cnt - 1)


li = [0] * n
for i in range(n):
    if arr[i] == "0":
        li[i] = (init_big + pow(2, n - i - 1, cnt + 1)) % (cnt + 1)
    elif ALL_ARR - (1 << (n - i - 1)) == 0 or cnt - 1 == 0:
        li[i] = "flg"
    else:
        li[i] = (init_small - pow(2, n - i - 1, cnt - 1)) % (cnt - 1)


ans = []

for x in li:
    if x == "flg":
        ans.append(0)
    else:
        ans.append(ret[x] + 1)

print(*ans, sep="\n")
import math
a,b,c = map(int, input().split())

if(a>=c or b>=c):
  print("No")
else:
  r=round(math.sqrt(a),1000000000) + round(math.sqrt(b),1000000000)
  s=round(math.sqrt(c),1000000000)

  if(r<s):
    print("Yes")
  else:
    print("No")

### FIXED CODE ###

K=int(input())

list = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 3, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]

print(list[K-1])
input = sys.stdin.readline
 
import heapq
N, M = map(int, input().split())
X = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])
heap = []
ans = 0
j = 0
 
for i in range(1, M+1): # M - i 日後にするバイトを考える
    while (j < N) and (X[j][0] <= i): # 支払いがi日以内
        heapq.heappush(heap, -X[j][1]) # 候補の追加。最大の値が欲しいためマイナスに
        j += 1
    if len(heap):
        ans += - heapq.heappop(heap) # 候補があるとき、候補から最大値を取り出す
print(ans)

### FIXED CODE ###

import heapq
N, M = map(int, input().split())
X = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[0])
heap = []
ans = 0
j = 0

for i in range(1, M+1): # M - i 日後にするバイトを考える
    while (j < N) and (X[j][0] <= i): # 支払いがi日以内
        heapq.heappush(heap, -X[j][1]) # 候補の追加。最大の値が欲しいためマイナスに
        j += 1
    if len(heap):
        ans += - heapq.heappop(heap) # 候補があるとき、候補から最大値を取り出す
print(ans)
import math
n = int(raw_input())
sqrt = int(math.sqrt(n))
p = [1]*(n+1)
p[0] = 0
for i in range(2,sqrt+1):
	if p[i]:
		p[2*i::i] = [0 for x in range(2*i,n+1,i)]

div = []
for i in range(2,n/2+1):
	if p[i] and n%i == 0:
		div.append(i)

p = [1]*(n+1)
p[0],p[n] = 0,0
for i in div:
	p[i::i] = [0 for x in range(i,n+1,i)]
	
print sum(p)

### FIXED CODE ###

def phi(n):
	r = n
	i = 2
	while i*i <= n:
		if n%i==0:
			r -= r/i
			while n%i==0:
				n /= i
		i += 1
	if n>1: r-= r/n
	return r

n = int(raw_input())
print phi(n)
N,M = map(int,input().split())
L = []
for i in range(N):
  tmp = list(map(int,input().split()))
  L.append(tmp[1:])

dicL = {}
for i in range(N):
  for l in L[i]:
    if l not in dicL:
      dicL[l] = [i]
    else:
      dicL[l].append(i)
#print(dicL)
E = [[] for _ in range(N)]
for k,v in dicL.items():
  if len(v) > 1:
    for i in range(len(v)-1):
      for j in range(i+1,len(v)):
        E[v[i]].append(v[j])
        E[v[j]].append(v[i])
for i in range(N):
  E[i] = set(E[i])
#print(E)
Visited = [0 for _ in range(N)]
def dfs(v):
  Visited[v] = 1
  for u in E[v]:
    if Visited[u] == 0:
      dfs(u)
dfs(0)
print('YES' if sum(Visited) == N else 'NO')


### FIXED CODE ###

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)

N,M = map(int,input().split())
L = []
for i in range(N):
  tmp = list(map(int,input().split()))
  L.append(tmp[1:])
#print(L)

# 人(0~N-1)と言語(N~M-1)の間で二部グラフを作る
E = [set() for _ in range(N+M)]
for i in range(N):
  for l in L[i]:
    E[i].add(l+N-1)
    E[l+N-1].add(i)
#print(E)

# 人のノードすべてに到達可能であればYES
Visited = [0 for _ in range(N+M)]
def dfs(v):
  Visited[v] = 1
  for u in E[v]:
    if Visited[u] == 0:
      dfs(u)
dfs(0)
print('YES' if sum(Visited[:N]) == N else 'NO')
def text_match_words(text, words):
	match_words = []
	for word in words:
		if word == text[:len(word)]:
			match_words.append(word)
	return match_words

def is_match_for(text, words):
	if "" == text: 
		return True
	else:
		match_words = text_match_words(text, words)
		if [] == match_words:
			return False
		else:
			return any([is_match_for(text[len(match_word):], words) for match_word in match_words])

if __name__ == "__main__":
	words = ("dream", "dreamer", "erase", "eraser")

	s = input()

	if is_match_for(s, words):
		print("YES")
	else:
		print("NO")

### FIXED CODE ###

import re

if re.match("(dream|dreamer|erase|eraser)*$", input()):
    print("YES")
else:
    print("NO")
a,v= map[list() ,int.split()]
b,w= map[list() ,int.split()]
t=input()

if w>=v:
    print("NO")

    elif abs(a-b)/abs(v-w)<=T:
        print("YES")

    else :
        print("NO")

### FIXED CODE ###

a,v= map(int, input().split())
b,w= map(int, input().split())
t=int(input())

if w>=v:
    print("NO")

elif (abs(a-b)/abs(v-w))<=t:
        print("YES")

else :
        print("NO")
a, b= map(int, input().split())
 
c=a+b
d=a-b
e=a*b
 
f=max[c, d, e]

print(f)

### FIXED CODE ###

a, b= map(int, input().split())
 
c=a+b
d=a-b
e=a*b
 
f=max([c, d, e])
 
print(f)
N=int(input())
s=[x for x in input()]
#print(s)
answers=[]

for i in range(1,N+1):
    sl=s[:i]
    #print(sl)
    sr=s[i:N]

    l=sl.count("W")
    r=sr.count("E")

    ans=l+r
    #print(ans)
    answers.append(ans)
fa=min(a for a in answers)
print(fa)


### FIXED CODE ###

a=list(map(int,input( ).split( )))
b=a[0]+a[1]
c=a[0]-a[1]
d=a[0]*a[1]
e=max(b,c,d)
print (e)
n = int(input())
for i in range(n):
    t, x, y = map(int, input().split())
    if x + y < t or (x + y + t) % 2:
        print("No")
        exit()
print("Yes")

### FIXED CODE ###

n = int(input())
t = [0 for _ in range(n+1)]
x = [0 for _ in range(n+1)]
y = [0 for _ in range(n+1)]
for i in range(n):
    t[i+1], x[i+1], y[i+1] = [int(z) for z in input().split()]
    if t[i+1] - t[i] < abs(x[i + 1] - x[i]) + abs(y[i + 1] - y[i]) or (t[i+1] % 2 != (abs(x[i+1]) + abs(y[i+1])) % 2):
        print('No')
        exit()
print('Yes')
n = int(input())

h = sum(list(str(n)))

print('Yes' if n % h == 0 else 'No')

### FIXED CODE ###

n = int(input())
h = sum(map(int, list(str(n))))

print('Yes' if n % h == 0 else 'No')
n = int(input())
A = [int(input()) for i in range(n)] * 2
dp = [[-1 for i in range(n * 2)] for j in range(n * 2)]

def dfs(i,j):
  #if (j - i > n - 1):undefined
  if dp[i][j] != -1:
    pass
  elif (j - i == n - 1):
    dp[i][j] = 0
  elif (j - i) % 2 == 0:
    if A[i - 1] > A[j + 1]:
      dp[i][j] = dfs(i - 1, j)
    else:
      dp[i][j] = dfs(i, j + 1)
  else:
    dp[i][j] = max(dfs(i - 1, j) + A[i - 1], dfs(i, j + 1) + A[j + 1])
  return dp[i][j]
ans = 0
for i in range(n):
  for j in range(i,2 * n):
    ans = max(ans, dfs(i,i) + A[i])
print(ans)


### FIXED CODE ###

import sys

sys.setrecursionlimit(10000)

n = int(input())
A = [int(input()) for i in range(n)] * 3
dp = [[-1 for i in range(n * 2)] for j in range(n * 2)]

def dfs(i,j):
  #if (j - i > n - 1):undefined
  if dp[i][j] != -1:
    pass
  elif (j - i == n - 1):
    dp[i][j] = 0
  elif (j - i) % 2 == 0:
    if A[i - 1] > A[j + 1]:
      dp[i][j] = dfs(i - 1, j)
    else:
      dp[i][j] = dfs(i, j + 1)
  else:
    dp[i][j] = max(dfs(i - 1, j) + A[i - 1], dfs(i, j + 1) + A[j + 1])
  return dp[i][j]
ans = 0
for i in range(n):
  ans = max(ans, dfs(i,i) + A[i])
print(ans)
while True:
  a, op, b = raw_input.split()
  a = int(a)
  b = int(b)
  if op == '+':
    print a + b
  elif op == '-':
    print a - b
  elif op == '*':
    print a * b
  elif op == '/':
    print a / b
  elif op == '?':
    break

### FIXED CODE ###

while True:
  a, op, b = raw_input().split()
  a = int(a)
  b = int(b)
  if op == '+':
    print a + b
  elif op == '-':
    print a - b
  elif op == '*':
    print a * b
  elif op == '/':
    print a / b
  elif op == '?':
    break
S = input()
T = input()
a = [a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z]
  print(if T == S + .index(a)"YES")
  else:
    print("NO")
    
    

### FIXED CODE ###


    
s = input()
t = input()

if t[:-1] == s:
    print("Yes")
else:
    print("No")
a,b,k=map(int,input().split())

if k<=a:
  print(str(a-k)+' '+str(b))
  
else:
  print(str(0)+' '+str(min(0,b-(k-a))))


### FIXED CODE ###

s,t=map(str,input().split())

print(t+s)
import fractions
from functools import reduce
 
def lcm_b(a, b):
        #print("base",a,b)
        return (a * b) // factions.gcd(a, b)
 
def lcm_o():
        global n
        return reduce(lcm_b, n)
 
def chk(v):
        global n
        for i in range(1,30):
                if v%2 == 1:break
                v = v//2
        t=2**(i-1)
        for j in range(len(n)):
                s=int(n[j]/t)
                if n[j] % t == 0 and s % 2 == 1:
                        n[j] = s
 
                else: return 0
        return int(t//2)
 
def mp(v):
        if v%2==1:v+=1
        return int(v//2)
 
N,M= [int(i) for i in input().split()]
n = [int(i) for i in input().split()]
n=sorted(set(n),reverse = True)
bs = n[0]//2
 
if len(n) > 1:
        c = chk(n[-1])
        if  c != 0:
                v = lcm_o()*c
                if v > M: print(0) 
 
                else: print(mp(M//v))
        
        else: print(0)
        
elif len(n)==1: 
	v = M//bs
	if v%2==1: v+=1
	print(int(v//2))

### FIXED CODE ###

import fractions
from functools import reduce
N,M= [int(i) for i in input().split()]
n = [int(i) for i in input().split()]
#print(n)
n=sorted(set(n),reverse = True)
bs = n[0]
#print(n)
#c=len(n)
 
 
def lcm_b(a, b):
        #print("base",a,b)
        return (a * b) // fractions.gcd(a, b)
 
def lcm_o():
        global n
        return reduce(lcm_b, n)
 
def chk(v):
        global n
        for i in range(1,30):
                if v%2 == 1:break
                v = v//2
        t=2**(i-1)
        for j in range(len(n)):
                if n[j] % t == 0 and (n[j] / t) % 2 == 1:
                        n[j] = int(n[j]/t)
                else: return 0
        return i-1
 
if len(n) > 1:
        
        c = chk(n[-1])
        
        if  c != 0:
                v = lcm_o()*(2**(c-1))
                
                if v > M:
                        print(0) 
                else:
                        v = M//v
                        if v%2==1: v+=1
                        print(int(v//2))
        
        else: print(0)
elif len(n)==1:
        v = int(bs*0.5)
        v = M//v
        if v%2==1: v+=1
        print(int(v//2))
import ita
import numpy as np
val1=input()
val2=input()
n=int(val1)
s=int(val2)
data=ita.array.make1d(1000)
ss=str(s)
for i in range(0,n):
    for j in range(i+1,n):
        for k in range(j+1,n):
            data[int(ss[i]+ss[j]+ss[k])]+=1
1000-data.count(0)

### FIXED CODE ###

val1=input()
s=input()
n=int(val1)
count=0
for i in range(0,1000):
    a=str(i).zfill(3) #ゼロうめ
    p=0
    for j in range(0,n):
        if a[p]==s[j]:
            p+=1
            if p==3:
                count+=1
                break
print(count)
N,A,B = map(int,input().split())

r = ''
while True:
    r += "b"*A
    if len(r) >= N:
        break
    r += "r"*B
    if len(r) >= N:
        break
print(r[:N].count('b'))

### FIXED CODE ###

N,A,B = map(int,input().split())

s = 0
s = int(N / (A+B))*A
if N % (A+B) > A:
    s += A
else:
    s += N % (A+B)
print(s)
import sys
input = sys.stdin.readline
def main():
    Q = 10**9+7
    N, M = map( int, input().split())
    S = list( map( int, input().split()))
    T = list( map( int, input().split()))
    dp = [ [0]*(M+1) for _ in range(N+1)]
    memo = [ [0]*(M+1) for _ in range(N+1)]
    for i in range(N):
        for j in range(M):
            if S[i] == T[j]:
                dp[i+1][j+1] = (dp[i+1][j] + dp[i][j+1]+1)%Q
            else:
                dp[i+1][j+1] = (dp[i+1][j] + dp[i][j+1] - dp[i][j])%Q
    print(dp[N][M]+1)
if __name__ == '__main__':
    main()


### FIXED CODE ###

#import sys
#input = sys.stdin.readline
def main():
    X, A = map( int, input().split())
    if X < A:
        print(0)
    else:
        print(10)

if __name__ == '__main__':
    main()
n=int(input())
tens=[]
others=[]
for i in range(n):
    s=int(input())
    if s%10==0:
        tens.append(s)
    else:
        others.append(s)
tens.sort(reverse=True)
others.sort(reverse=True)

score=sum(tens)+sum(others)
if score%10==0:
    print(score-min(others))
else:
    print(score)

### FIXED CODE ###

n=int(input())
tens=[]
others=[]
for i in range(n):
    s=int(input())
    if s%10==0:
        tens.append(s)
    else:
        others.append(s)
tens.sort(reverse=True)
others.sort(reverse=True)

score=sum(tens)+sum(others)
if score%10==0:
    if len(others)!=0:
        print(score-min(others))
    else:
        print(0)
else:
    print(score)
N=int(input())
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr
a=0
T=factorization(N)
l=len(T)
for i in range(l):
    if T[i][1]<3:
        a+=1

    elif T[i][1]<6:
        a+=2
    elif T[i][1]<10:
        a+=3
    elif T[i][1]<15:
        a+=4
    elif T[i][1]<21:
        a+=5
    elif T[i][1]<28:
        a+=6
    elif T[i][1]<36:
        a+=7
    elif T[i][1]<45:
        a+=8
    elif T[i][1]<55:
        a+=9
    elif T[i][1]<66:
        a+=10
print(a)
  


### FIXED CODE ###

A,B=map(int,input().split())
print(A*B)
x=int(input())
y=int(input())
print("{} {}" % (x*y, 2*(x+y)))

### FIXED CODE ###

x,y=[int(x) for x in input().strip().split()]
print("{} {}".format(x*y, 2*(x+y)))
A,Z = map(str, input().split())
a=[str(x) for x in A]
z=[str(x) for x in Z]
aa =int(a[0]+a[1]+a[2]+'0'+'0')
#print(aa)
zz =int(z[0]+z[1]+z[2]+'0'+'0')
#print(zz)
#gapa = (int(Z)-int(A))//100+1
gapb = (zz-aa)//100+1
cnt = 0
if aa<int(A):
    #print('A')
    cnt-=1
if zz>int(Z):
    #print('Z')
    cnt-=1
print(gapa)
print(gapb+cnt)
#print(cnt)
#print(gap+cnt)


### FIXED CODE ###

A,Z = map(str, input().split())
a=[str(x) for x in A]
z=[str(x) for x in Z]
aa =int(a[0]+a[1]+a[2])
aaa =int(a[0]+a[1]+a[2]+a[1]+a[0])
zz =int(z[0]+z[1]+z[2])
zzz =int(z[0]+z[1]+z[2]+z[1]+z[0])
gap = (zz-aa)+1
cnt = 0
if aaa<int(A):
    cnt-=1
if zzz>int(Z):
    cnt-=1
print(gap+cnt)
a = int(input())
b = int(input())

for c in range(1,4):
    answer = a * b * c
    mod = answer % 2
    if mod == 1:
        print('Yes')
        break
    print('No')
    break

### FIXED CODE ###

# -*- coding: utf-8 -*-

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

for c in range(1,4):
    answer = a * b * c
    mod = answer % 2  
    if mod == 1:
        print('Yes')  
        break
    print('No') 
    break
print(1-input()[:2]in input())


### FIXED CODE ###

print(1*(input()[:2]!=input()[:2]))
L,R = [int(i) for i in input().split()]
if R-L >= 4038:
    print(0)
else:
    ans = []
    for i in range(L,R+1):
        ans.append(i % mod)
    ans = sorted(ans)
    ans2 = (ans[0]*ans[1])%mod
    print(ans2)

### FIXED CODE ###

L,R = [int(i) for i in input().split()]
mod = 2019
if R-L >= 673:
    print(0)
else:
    ans = []
    for i in range(L,R+1):
        for ii in range(i+1,R+1):
            ans.append((i*ii)%mod)
    ans = sorted(ans)
    print(ans[0])
def aa097():
    a,b,c,d = list(map(int, input().split()))
    if abs(a-c) <= d:
        print('Yes')
        sys.exit()

    if abs(a-b) <= d and abs(b-c) <= d:
        print('Yes')
        sys.exit()

    print('No')

aa097()


### FIXED CODE ###

import sys

def aa097():
    a,b,c,d = list(map(int, input().split()))
    if abs(a-c) <= d:
        print('Yes')
        sys.exit()

    if abs(a-b) <= d and abs(b-c) <= d:
        print('Yes')
        sys.exit()

    print('No')

aa097()
N = int(input())
l = [0] * N
l = list(map(int, input().split()))
sum = 0
a = [0] * N
for i in range(N):
    sum += l[i]
x = 0
result = 1145141919810931931
for i in range(N):
    x += l[i]
    result = min((result, abs(sum - 2 * x)))
print(result)


### FIXED CODE ###

a, b = list(map(int, input().split()))
if a % 3 == 0 or b % 3 == 0 or (a + b) % 3 == 0:
    print("Possible")
else:
    print("Impossible")
if __name__ =='__main__':
    N ＝ raw_input()
    A = raw_input()
    N = N**2
    return N-A

### FIXED CODE ###

if __name__ =='__main__':
    N = int(input())
    A = int(input())
    ans = N**2-A
    print(ans)
n = int(input())
for i in range(n):
    k = input().split()
    if k[0] == 'S':
        for i in range(1,14):
            if int(k[1])==i:
                continue
            else:
                s = list()
                s.append(i)
                s.sort()
                sl = s.len()
    if k[0] == 'H':
        for i in range(1,14):
            if int(k[1])==i:
                continue
            else:
                h = list()
                h.append(i)
                h.sort()
                hl = h.len()
    if k[0] == 'C':
        for i in range(1,14):
            if int(k[1])==i:
                continue
            else:
                c = list()
                c.append(i)
                c.sort()
                cl = c.len()
    if k[0] == 'D':
        for i in range(1,14):
            if int(k[1])==i:
                continue
            else:
                d = list()
                d.append(i)
                d.sort()
                dl = d.len()
                
for i in range(1,sl):
    print('S {0}'.format(s[i]))
    
for i in range(1,hl):
    print('H {0}'.format(h[i]))
 
for i in range(1,dl):
    print('D {0}'.format(d[i])) 

for i in range(1,cl):
    print('C {0}'.format(c[i]))


### FIXED CODE ###

n = int(input())
S = [1,2,3,4,5,6,7,8,9,10,11,12,13]
C = [1,2,3,4,5,6,7,8,9,10,11,12,13]
H = [1,2,3,4,5,6,7,8,9,10,11,12,13]
D = [1,2,3,4,5,6,7,8,9,10,11,12,13]

for i in range(n):
    variations,number = input().split()
    if variations == 'S':
        S.remove(int(number))
    if variations == 'C':
        C.remove(int(number))
    if variations == 'H':
        H.remove(int(number))
    if variations == 'D':
        D.remove(int(number))

for i in range(len(S)):
    print('{} {}'.format('S',S[i]))

for i in range(len(H)):
    print('{} {}'.format('H',H[i]))

for i in range(len(C)):
    print('{} {}'.format('C',C[i]))

for i in range(len(D)):
    print('{} {}'.format('D',D[i]))
sides = raw_input()
sides = [int(i) for i in sides]
m = max(sides)
sides = [i for i in sides if i!=m]
print(sides[0]*sides[1]/2)

### FIXED CODE ###

sides = raw_input()
sides = [int(i) for i in sides.split(" ")]
m = max(sides)
sides = [i for i in sides if i!=m]
print(sides[0]*sides[1]/2)
def solve(arr, target):
	return solve_rec(0, arr, target)

def solve_rec(i, arr, target):
	if target == 0:
		return True
	if i >= len(arr):
		return False
	res1 = solve_rec(i + 1, arr, target)
	res2 = solve_rec(i + 1, arr, target - arr[i])
	return res1 or res2

n = int(input())
arr = list(map(int, input().split()))
q = int(input())
targets = list(map(int, input().split()))
for i in range(q):
	res = solve(arr, targets[i])
	if res == True:
		print('yes')
	else:
		print('no')



### FIXED CODE ###

def subset_sum(n, s, a):
	dp = [[0 for x in range(s+1)] for x in range(n+1)]
	dp[0][0]=1
	for i in range(n):
		v = a[i]
		for j in range(s+1):
			if v > j:
				dp[i+1][j] = dp[i][j]
			else:
				dp[i+1][j] = dp[i][j]+dp[i][j-v]
	return dp[n][s] > 0

n = int(input())
a = list(map(int, input().split()))
q = int(input())
m = list(map(int, input().split()))
for i in range(q):
	if subset_sum(n, m[i], a) == True:
		print('yes')
	else:
		print('no')
a = list(map(int,input().split()))
if (a[0] * 4) <= a[1]:
  if (a[0] * 2) >= a[1]:
    print("Yes")
  else:
    print("No")
else:
print("No")

### FIXED CODE ###

a = list(map(int,input().split()))
if (a[0] * 4) >= a[1] and (a[0] * 2) <= a[1] and a[1] % 2 == 0:
    print("Yes")
else:
  print("No")
N = int(input())
d = list(map(int, input().split()))

same = N / 2

# d.sort()

# distribution = [0] * d[len(d) - 1]
# total = 0
# for di in d:
#     num = d.count(di)
#     distribution[di - 1] = num

table = {}
for di in d:
    table[di] = 0 if table[di] is None else table[di] + 1

# total = 0
# totals = [0] * d[len(d) - 1]
# num = 0
# for i in range(len(distribution)):
#     total += distribution[i]
#     totals[i] = total

#     if totals[i] == same:
#         num += 1
#     elif num >= 1:
#         break

print(1)


### FIXED CODE ###

N = int(input())
d = list(map(int, input().split()))

same = N / 2

# d.sort()

# distribution = [0] * d[len(d) - 1]
# total = 0
# for di in d:
#     num = d.count(di)
#     distribution[di - 1] = num

table = {}
for di in d:
    table[di] = 1 if table.get(di) is None else table.get(di) + 1
table = sorted(table.items())

total = 0
start = 0
end = 0
for difficulty, num in table:
    total += num

    if start == 0 and total == same:
        start = difficulty
    elif start != 0:
        end = difficulty
        break

# print(table, start, end)

answer = end - start
print(answer)
N, M = map(int,input().split())

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

V = [list(map(int, input().split())) for i in range(M)]

count = 0

dic = {}

for i in range(1, N):
  dic[i] = set()

for hen in V:
  dic[hen[0]].add(hen[1])
  dic[hen[1]].add(hen[0])

print(sum(all([H[i] > hs for hs in dic[i]]) for i in range(N)))

### FIXED CODE ###

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

H = list(map(int, input().split()))
H.insert(0, 0)

V = [list(map(int, input().split())) for i in range(M)]

count = 0

dic = {}

for i in range(1, N+1):
  dic[i] = set()

for hen in V:
  dic[hen[0]].add(hen[1])
  dic[hen[1]].add(hen[0])

print(sum(all([H[i] > H[hs] for hs in dic[i]]) for i in range(1, N+1)))