Harryxun/stf_run huggingface dataset:
N, K = map(int, input().split())
aa = map(int, input().split())

p = []
for i in range(N-1):
  for j in range(i+1, N):
    p.append(i*j)

print(p.sorted[K])

### FIXED CODE ###

abc = map(int, input().split())
 
abc_set = set(abc)

if len(abc_set) == 2:
  print('Yes')
else:
  print('No')
import sys
sys.setrecursionlimit(20000)
n,k=map(int,input().split())
ans=k
t=[set()for i in range(n)]
dp=[k]+[0]*(n-1)
for i in range(n-1):
  a,b=map(int,input().split())
  t[a-1].add(b)
  t[b-1].add(a)
no=1
w=k
def a(noo):
  global ans
  w=k
  for i in t[noo-1]:
    t[i-1].discard(noo)
    if w==0:print(0);exit()
    dp[i-1]=w-2;ans=(ans*(w-2))%(10**9+7)
    w-=1
    a(i)
for i in t[no-1]:
  t[i-1].discard(no)
  w-=1
  dp[i-1]=w;ans=(ans*w)%(10**9+7)
  a(i)
print(ans)

### FIXED CODE ###

import sys
sys.setrecursionlimit(100000)
n,k=map(int,input().split())
ans=k
t=[set()for i in range(n)]
dp=[k]+[0]*(n-1)
for i in range(n-1):
  a,b=map(int,input().split())
  t[a-1].add(b)
  t[b-1].add(a)
no=1
w=k
b=True
def a(noo):
  global ans
  w=k
  for i in t[noo-1]:
    t[i-1].discard(noo)
    if w==0:print(0);exit()
    dp[i-1]=w-2;ans=(ans*(w-2))%(10**9+7)
    w-=1
    a(i)
for i in t[no-1]:
  t[i-1].discard(no)
  w-=1
  dp[i-1]=w;ans=(ans*w)%(10**9+7)
  a(i)
print(ans)
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

L, R = MAP()

if L-R+1 >= 2019:
	print(0)
	exit()

a = list(range(L, R+1))
ans = 2019

for x, y in combinations(a, 2):
	ans = min(ans, (x*y)%2019)

print(ans)


### FIXED CODE ###

import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy, copy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

L, R = MAP()

if abs(L-R)+1 >= 2019:
	print(0)
	exit()

a = list(range(L, R+1))
ans = 2019

for x, y in combinations(a, 2):
	ans = min(ans, (x*y)%2019)

print(ans)
import math
def naiseki(x1,y1,x2,y2,x3,y3,x4,y4):
    if ((x2-x1)*(y4-y3)-(y2-y1)*(x4-x3)) == 0:
        print("YES")
    else:
        print("NO")
a = int(raw_input())
f=[]
for i in range(a):
    f.append(map(float,raw_input().split()))
for g in f:
    try:
        x1=g[0]
        y1=g[1]
        x2=g[2]
        y2=g[3]
        x3=g[4]
        y3=g[5]
        x4=g[6]
        y4=g[7]
        naiseki(x1,y1,x2,y2,x3,y3,x4,y4)
    except:
        print("NO")

### FIXED CODE ###

n = int(input())
for i in range(n):
    x1,y1,x2,y2,x3,y3,x4,y4=map(float,input().split())
    print("YES" if abs((y2-y1)*(x4-x3)-(x2-x1)*(y4-y3)) < 1e-10 else "NO")
while True:
   x=input()
   if x="0":
       break
   cnt = 0
   for i in x:
       num = int(i)
       cnt += num
   print(cnt)

### FIXED CODE ###

while True:
   x=input()
   if x=="0":
       break
   cnt = 0
   for i in x:
       num = int(i)
       cnt += num
   print(cnt)
n=int(input())
a=[int(i) for i in input().split()]
r=0
t=0
while t<n:
    if a[t]==t+1:
            r+=1
      t+=1+r
print(r)


### FIXED CODE ###

n=int(input())
a=[int(i) for i in input().split()]

ans=0
t=0
while t<n:
    if a[t]==t+1:
        if t+1<n and a[t+1]==t+2:
            ans+=1
            t+=2
        else:
            ans+=1
            t+=2
    else:
        t+=1
print(ans)
a = map(int, raw_input().split())
  
a.sort()
for i in range(len(a)):
  print '%d ' % (a[i]), 
print '?\n'

### FIXED CODE ###

a = map(int, raw_input().split())
  
a.sort()
print '%d %d %d' % (a[0], a[1], a[2])
A,B = map(int,input().split())

if A>B:
	print(A*2-1)
elif A=B:
	print(A+B)
else:
	print(B*2-1)

### FIXED CODE ###

A,B = map(int,input().split())
 
if A>B:
	print(A*2-1)
elif A==B:
	print(A+B)
else:
	print(B*2-1)
import scipy as sp

total_cost = 0

N, M = (map(int, input().split()))
A = sp.array(list(map(int, input().split())))
B = sp.array(list(map(int, input().split())))

AB_list = sp.stack([A, B]).T

AB = AB_list[:, AB_list[0,:].argsort()]

A_list = AB[0,:]
B_list = AB[1,:]
for i in range(N):
    if B_list[i]<M:
        M -= B_list[i]
        total_cost += A_list[i] * B_list[i]
    else:
        total_cost += M * A_list[i]
print(total_cost)


### FIXED CODE ###

total_cost = 0

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

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

AB_list = sorted(AB_list)

for i in range(N):
    if AB_list[i][1]<M:
        M = M - AB_list[i][1]
        total_cost =  total_cost + AB_list[i][0]*AB_list[i][1]
    else:
        total_cost = total_cost + M * AB_list[i][0]
        break
print(total_cost)
# 素因数分解

N=int(input())
cand=[]

def check(N0,K0):
    if N0%K0==0:
        return check(int(N0/K0),K0)
    elif N0%K0==1:
        return 1
    else:
        return 0

def check0(N0,K0):
    while N0%K0==0:
        N0=int(N0/K0)
    if N0%K0==1:
        return 1
    else:
        return 0

# N-1の約数の数
for i in range(2,int((N-1)**0.5)+1):#O(N**0.5)
    if (N-1)%i==0:
        cand.append(i)
        cand.append(int((N-1)/i))

# Nの約数
for i in range(2,int(N**0.5)+1):#O(N**0.5)
    if N%i==0:
        cand.append(i)
        cand.append(int(N/i))
cand.append(N)
cand.append(N-1)

count=0
for i in range(len(cand)):
    if check(N,cand[i]):
        count+=1

print(count)

### FIXED CODE ###

# 素因数分解

N=int(input())
cand=[]

def check(N0,K0):
    if N0%K0==0:
        return check(int(N0/K0),K0)
    elif N0%K0==1:
        return 1
    else:
        return 0

def check0(N0,K0):
    while N0%K0==0:
        N0=int(N0/K0)
    if N0%K0==1:
        return 1
    else:
        return 0

# N-1の約数の数
for i in range(2,int((N-1)**0.5)+1):#O(N**0.5)
    if (N-1)%i==0:
        cand.append(i)
        if i!=int((N-1)/i):
            cand.append(int((N-1)/i))
if N>2:
    cand.append(N-1)

# Nの約数
for i in range(2,int(N**0.5)+1):#O(N**0.5)
    if N%i==0:
        cand.append(i)
        if i!=int(N/i):
            cand.append(int(N/i))
cand.append(N)

#print(cand)
count=0
for i in range(len(cand)):
    if check(N,cand[i]):
        count+=1

print(count)
n=int(input())
x_=input()
px=x_.count("1")
if not px:
    print(0)
    for i in range(n-1):
        print(1)
    exit()

x=int(x_,2)

pow2=[1]

for i in range(n):
    tmp=pow2[-1]
    tmp*=2
    tmp%=px+1
    pow2.append(tmp)
pow22=[1]
for i in range(n):
    tmp=pow22[-1]
    tmp*=2
    tmp%=px-1
    pow22.append(tmp)
x1=x%(px+1)
x2=x%(px-1)
ans=[]
for i in range(n):
    tmp=0;dv=0
    if int(x_[-i-1]):
        tmp=x2-pow22[i]
        dv=px-1
    else:
        tmp=x1+pow2[i]
        dv=px+1
    if dv==0:
        ans.append(0)
        continue
    cnt=1
    while tmp:
        if not dv:
            break
        tmp%=dv
        dv=bin(tmp).count("1")
        if not tmp:
            break
        cnt+=1
    ans.append(cnt)
for i in ans[::-1]:
    print(i)

### FIXED CODE ###

n=int(input())
x_=input()
px=x_.count("1")
if not px:
    for i in range(n):
        print(1)
    exit()
if px==1:
####[上から] i 桁目
    for i in range(n):
        if int(x_[i]):
            print(0)
        else:
            if i==n-1 or int(x_[-1])==1:###
                print(2)
            else:
                print(1)
    exit()
x=int(x_,2)

pow2=[1]

for i in range(n):
    tmp=pow2[-1]
    tmp*=2
    tmp%=px+1
    pow2.append(tmp)
pow22=[1]
for i in range(n):
    tmp=pow22[-1]
    tmp*=2
    tmp%=px-1
    pow22.append(tmp)
x1=x%(px+1)
x2=x%(px-1)
ans=[]
for i in range(n):
    tmp=0;dv=0
    if int(x_[-i-1]):
        tmp=x2-pow22[i]
        tmp%=(px-1)
        dv=px-1
    else:
        tmp=x1+pow2[i]
        tmp%=(px+1)
        dv=px+1
    
    cnt=1
    while tmp:
        
        dv=bin(tmp).count("1")
        if not dv or not tmp:
            break
        
        tmp%=dv
        cnt+=1
    ans.append(cnt)
for i in ans[::-1]:
    print(i)
n=int(input())
s=input()
c=1
for i in range(1,N):
  if not(S[i]==S[i-1]):c+=1
print(c)

### FIXED CODE ###

n=int(input())
s=input()
c=1
for i in range(1,n):
  if not(s[i]==s[i-1]):c+=1
print(c)
N,M=map(int,input().split())
    sc=[list(map(int,input().split())) for _ in range(M)]
    for i in range(10**N):
        ans=str(i)
        if len(ans)==N and all(ans[s-1]==str(c) for s,c in sc):
            print(ans)
            quit()
    print(-1)

### FIXED CODE ###

n,m=map(int,input().split())
sc=[list(map(int,input().split())) for _ in range(m)]
for i in range(10**n):
    ans=str(i)
    if len(ans)==n and all(ans[s-1]==str(c) for s,c in sc):
        print(ans)
        exit()
print(-1)
date = input()
tdate=[]
 
for s in date:
  tdate.insert[s]
  
if tdate[5] != "0":
  mon = int(tdate[5] + tdate[6])
else:
  mon = int(tdate[6])
 
if mon <= 4:
  print("Heisei")
else:
  print("TBD")

### FIXED CODE ###

date = input()
tdate=[]
 
for s in date:
  tdate.append(s)
  
if tdate[5] != "0":
  mon = int(tdate[5] + tdate[6])
else:
  mon = int(tdate[6])


if mon <= 4:
  print("Heisei")
else:
  print("TBD")
b = input()

bases = ['A', 'C', 'G', 'T']

for idx, base in enumerate(bases):
  if base == b:
    print(bases[int(~bin(idx))])

### FIXED CODE ###

b = input()

bases = ('A', 'C', 'G', 'T')

for idx, base in enumerate(bases):
  if base == b:
    print(bases[int(~(idx))])
    break
N,M=map(int,input().split())

print("{}{}".format(N.M))

### FIXED CODE ###

N,M=map(int,input().split())
if N == M:
    print("Yes")
else:
    print("No")
A,B,C = map(int,input().split())
max(10 * A + B + C, A + 10*B + C,　A + B + 10 * C)

### FIXED CODE ###

A,B,C = map(int,input().split())
ans = max(10*A + B + C, A+ 10*B + C, A + B + 10*C)
print(ans)
r = 0
s = input()
for n in len(s):
  k = (-1)*(n+1)
  if s[n] != s[k]:
    r += 1
print(r/2)


### FIXED CODE ###

r = 0
s = input()
for n in range(len(s)):
  if s[n] != s[-n-1]:
    r += 1
print(r//2)
N = int(input())
A = list(map(int,input().split()))
k = 0
S = 0

if N%2 == 0:
    k = (N+1)*N//2
else:
    k = (N+1)*(N//2)+(N+1)//2

Sum_A = sum(A)    
b = (sum_A-k)//N

print(sum_A-(b*N+k))

### FIXED CODE ###

N = int(input())
if N%2 == 0:
    print(N)
else:
    print(N*2)
#coding:utf-8
a, b = map(int, input().split)
print(max(0, a - 2*b))

### FIXED CODE ###

#coding:utf-8
a, b = map(int, input().split())
print(max(0, a - 2*b))
n,m = map(int,input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]

def check(i,j):
    for row in range(m):
        for col in range(m):
            if a[row + i][col + j] == b[row][col]:
                return True

    return False
for i in range(n-m+1):
    for j in range(n-m+1):
        if check(i,j):
            print("Yes")
            exit()


print("No")


### FIXED CODE ###

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


if A == 1 or B == 1:
    if A == B:
        print("Draw")
        exit()
    elif A == 1 and A < B:
        print("Alice")
        exit()
    elif B == 1 and B < A:
        print("Bob")
        exit()

if A < B :
    print("Bob")
elif A > B:
    print("Alice")
else :
    print("Draw")
L = int(input())
n = len(format(L - 1, 'b')) + 1
m = 2 ** (n - 1) + format(L - 1, 'b').count('1') - 1
print(n, m)
for i in range(n - 1):
    print(i + 1, i + 2, 0)
    print(i + 1, i + 2, 2 ** i)
w = 2 ** (n - 1)
b = int(format(L - 1, 'b')[1:], 2)
for j in range(20, -1, -1):
    if b >> j & 1:
        print(j + 1, n, w)
        w += 2 ** j

### FIXED CODE ###

L = int(input())
b = format(L, 'b')
n = len(b)
m = 2 * (n - 1) + b.count('1') - 1
print(n, m)
for i in range(1, n):
    print(i, i + 1, 0)
    print(i, i + 1, 2 ** (i - 1))
w = 2 ** (n - 1)
for j in range(20,-1,-1):
    if (L - w) >> j & 1:
        print(j + 1, n, w)
        w += 2 ** j
from sys import stdin
from math import factorial

def permutations_count(n, r):
  return factorial(n) // factorial(r) // factorial(n - r)

N,K = map(int,stdin.readline().split())
mod = pow(10,9)+7

frame = N-K+1
for i in range(1,K+1):
  select=permutations_count(frame, i) % mod
  pattern=permutations_count(K-1, i-1) % mod
  print((select * pattern) % mod )

### FIXED CODE ###

from sys import stdin
from math import factorial

def permutations_count(n, r):
  return factorial(n) // factorial(r) // factorial(n - r)

N,K = map(int,stdin.readline().split())
mod = pow(10,9)+7

frame = N-K+1
for i in range(1,K+1):
  if K == N:
    if i == 1:
      print("1")
    else:
      print("0")
  else:
    if i > frame:
      print("0")
    else:
      select=permutations_count(frame, i) % mod
      pattern=permutations_count(K-1, i-1) % mod
      print((select * pattern) % mod )
n, a, b, c = map(int, input().split())


def calc(x, y):
    if x - 1 >= 0:
        return (x - 1, y)
    elif y - 1 >= 0:
        return (x, y - 1)


answers = []
for i in range(n):
    s = list(map(str, input().split()))
    old_a = a
    old_b = b
    old_c = c

    if s == 'AB':
        a, b = calc(a, b)
    elif s == 'AC':
        a, c = calc(a, c)
    elif s == 'BC':
        b, c = calc(b, c)

    if a > old_a:
        answers.append('A')
    elif b > old_b:
        answers.append('B')
    elif c > old_c:
        answers.append('C')

    if a >= 0 and b >= 0 and c >= 0:
        print('No')
        quit()


print('Yes')
for ans in answers:
    print(ans)


### FIXED CODE ###

s = str(input())

a = ''

if s == 'ABC':
    a = 'ARC'
elif s == 'ARC':
    a = 'ABC'

print(a)
a,b,c=[input() for i in range(3)]
print(a[0]+b[1]+c[3])

### FIXED CODE ###

a,b,c=[input() for i in range(3)]
print(a[0]+b[1]+c[2])
a,p = map(int, input().spilit())
print((3*a+p)/2-(3*a+p%2))


### FIXED CODE ###

a,p = map(int, input().split())
print(int(((3*a+p)-(3*a+p)%2)/2))
import sys
a = list(map(int,sys.stdin.readline().split()))
n = a.pop(0)

for i in range(n):
	b = set(a[:i]+a[i+1:])
	print(max(b))
	del b

### FIXED CODE ###

n = int(input())
a = [int(input()) for i in range(n)]
m = max(a)

k = [i for i, x in enumerate(a) if x == m]

if len(k)>=2:
	for i in a:
		print(m)
else:
	b = []
	b += a
	mi = b.index(m)
	b.pop(mi) 
	m2 = max(b)
	for i in a:
		if i != m:
			print(m)
		else:
			print(m2)
in = map(int(),input().strip().split(" "))
res = in[0] * in [1] %2
if res ==0:
  print("Even")
else:
  print("Odd")
 

### FIXED CODE ###

data = list(map(lambda x:int(x),input().strip().split()))
res = data[0]*data[1]%2
if res ==0:
  print("Even")
else:
  print("Odd")
#include <stdio.h>
int main (){
int gatos, animais, X;
scanf("%d%d%d", &gatos,&animais,&X);
if (X >= gatos && animais + gatos >= X)
    printf("YES");
else
	printf("NO");

	return 0;
}

### FIXED CODE ###

num = input()
a = int(num.split(' ')[0])
b = int(num.split(' ')[1])
x = int(num.split(' ')[2])


if a+b>=x:
    if a>x:
        print("NO")
    else:
        print("YES")
else:
    print("NO")
#
H, W = list(map(int, input().split()))
M = []
for i in range(H):
    M.append(list(input().rstrip()))

#
def walk(pos, steps=0):
    x, y = pos
    #print(pos, M)

    #
    if M[y][x]=='.' or steps<M[y][x]:
        M[y][x] = steps
    else:
        #print('A')
        return

    # up
    if y>0 and M[y-1][x]!='#':
        walk((x, y-1), steps+1)
    # down
    if y<H-1 and M[y+1][x]!='#':
        walk((x, y+1), steps+1)
    # left
    if x>0 and M[y][x-1]!='#':
        walk((x-1, y), steps+1)
    # right
    if x<W-1 and M[y][x+1]!='#':
        walk((x+1, y), steps+1)
    #print('B')

#
walk((W-1, H-1))
#print(M)
#exit()

#
if M[0][0]=='.':
    print(-1)
else:
    blocks = sum([m.count('#') for m in M])
    print(H*W - blocks - M[0][0] - 1)


### FIXED CODE ###

# BFS version

#
H, W = list(map(int, input().split()))
M = []
for i in range(H):
    M.append(list(input().rstrip()))

#
def walk(pos):
    queue = [pos]

    while len(queue)>0:
        pos = queue.pop(0)
        x, y = pos
        val = M[y][x]
        #print(x,y,val)

        # up
        if y>0 and (M[y-1][x]=='.' or (isinstance(M[y-1][x], int) and val+1<M[y-1][x])):
            M[y-1][x] = val + 1
            queue += [(x, y-1)]
        # down
        if y<H-1 and (M[y+1][x]=='.' or (isinstance(M[y+1][x], int) and val+1<M[y+1][x])):
            M[y+1][x] = val + 1
            queue += [(x, y+1)]
        # left
        if x>0 and (M[y][x-1]=='.' or (isinstance(M[y][x-1], int) and val+1<M[y][x-1])):
            M[y][x-1] = val + 1
            queue += [(x-1, y)]
        # right
        if x<W-1 and (M[y][x+1]=='.' or (isinstance(M[y][x+1], int) and val+1<M[y][x+1])):
            M[y][x+1] = val + 1
            queue += [(x+1, y)]
        #print('B')

#
M[H-1][W-1] = 1
walk((W-1, H-1))
#print(M)
#exit()

#
if M[0][0]=='.':
    print(-1)
else:
    blocks = sum([m.count('#') for m in M])
    print(H*W - blocks - M[0][0])
import numpy as np
sys.setrecursionlimit(10**5)

N, M = map(int, input().split())
#dp[v]: start from v maxpath
dp = np.ones((N),dtype=int) * -1

gragh = [[] for i in range(N)]
for _ in range(M):
    x,y = map(int, input().split())
    gragh[x-1].append(y-1)

#solve DAG and topological sort by recursive funciton
def f(v,G=gragh):
    if dp[v] != -1:
        return dp[v]
    ret = 0
    for u in G[v]:
        ret = max(ret, f(u) + 1)
    return ret
for v in range(N):
    dp[v] = f(v)
print(np.max(dp))

### FIXED CODE ###

import sys
sys.setrecursionlimit(10**5)

N, M = map(int, input().split())
#dp[v]: start from v maxpath
dp = [-1 for _ in range(N)]

gragh = [[] for _ in range(N)]
for _ in range(M):
    x,y = map(int, input().split())
    gragh[x-1].append(y-1)

#solve DAG and topological sort by memo recursive funciton
def f(v,G=gragh):
    if dp[v] != -1:
        return dp[v]
    ret = 0
    for u in G[v]:
        ret = max(ret, f(u) + 1)
    dp[v] = ret
    return ret
for v in range(N):
    dp[v] = f(v)
print(max(dp))
N, K = map(int, input().split())

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

min_idx = A.index(min(A))

if K >= N:
    print(1)
else:
    if (n-1)%(k-1):
        print((N - 1) // (K - 1) + 1)
    else:
        print((N - 1)// (K - 1))

### FIXED CODE ###

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

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

min_idx = A.index(min(A))

if K >= N:
    print(1)
else:
    if ((N-1)%(K-1) == 0):
        print((N - 1)// (K - 1))
    else:
        print((N - 1) // (K - 1) + 1)
s = input()
print chr(ord(s) + 1)

### FIXED CODE ###

s = input()
print(chr(ord(s[0]) + 1))
a=[input()]
b=a(0)
c=a(1)
d=a(2)
e=c/b
if e>d:
  print(d)
elif d>e:
  print(e)

### FIXED CODE ###

a=list(input().split())
b=int(a[0])
c=int(a[1])
d=int(a[2])
e=int(c/b)
if e>=d:
  print(d)
elif d>e:
  print(e)
import math
N=int(input())
ans=0
for i in range(1,N):
  Y=math.ceil(N/i)
  ans+=(Y*(Y+1)*x)//2
print(ans)

### FIXED CODE ###

N = int(input())
ans = 0
for i in range(1, N + 1):
    largest = N // i * i
    ans += ((largest + i) * (N // i)) // 2
print(ans)
N,K = input().split()
N = int(N)
K = int(K)
h = [int(input()) for i in range(N)]
r = 0
for j in range(N):
  if h[j] >= K:
    r += 1
print(r)


### FIXED CODE ###

N,K = list(map(int, input().split()))
h = list(map(int, input().split()))
r = 0
for j in range(N):
  if int(h[j]) >= K:
    r += 1
print(r)
A, B = list(map(int, input().split()))

def xorsum(m):
  if m==3:
    return 0
  if m==2:
    return 3
  if m==1:
    return 1
  if m==0:
    return 0
  h=1
  while h<=m:
    h=h*2
  h=h//2
  return xorsum(m-h)^(((m-h+1)%2)*h)

print(xorsum(B)^xorsum(A-1))

  
  

  
  

### FIXED CODE ###

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

def xorsum(m):
  if m==3:
    return 0
  if m==2:
    return 3
  if m==1:
    return 1
  if m==0:
    return 0
  if m==-1:
    return 0
  h=1
  while h<=m:
    h=h*2
  h=h//2
  return xorsum(m-h)^(((m-h+1)%2)*h)

print(xorsum(B)^xorsum(A-1))
N = int(input())
p = [int(i) for i in input().split(" ")]
ans = 0

for i in range(0,N):
    if p[i] == (i+1):
        if p[i+1] == (i+1):
            t = p[i]
            p[i] = p[i+1]
            p[i+1] = t
            ans += 1
        else:
            ans += 1
            d = -1 if i == N-1 else 1
            t = p[i]
            p[i] = p[i+d]
            p[i+d] = t
            
print(ans)


### FIXED CODE ###

N = int(input())
p = [int(i) for i in input().split(" ")]
ans = 0

for i in range(0,N):
    if p[i] == (i+1):
        if i == N-1:
            ans += 1
        elif p[i+1] == (i+2):
            t = p[i]
            p[i] = p[i+1]
            p[i+1] = t
            ans += 1
        else:
            ans += 1
            t = p[i]
            p[i] = p[i+1]
            p[i+1] = t
            
print(ans)
def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

d = i()
if d == 25:
	print("Christmas")
elif d = 24:
	print("Christmas Eve")
elif d == 23:
	print("Christmas Eve Eve")
else:
	print("Christmas Eve Eve Eve")


### FIXED CODE ###

def i():
	return int(input())
def i2():
	return map(int,input().split())
def s():
	return str(input())
def l():
	return list(input())
def intl():
	return list(int(k) for k in input().split())

d = i()
if d == 25:
	print("Christmas")
elif d == 24:
	print("Christmas Eve")
elif d == 23:
	print("Christmas Eve Eve")
else:
	print("Christmas Eve Eve Eve")
import os
A,B = map(int, os.system("dd").split())
print (A-1)*(B-1)


### FIXED CODE ###

A,B = map(int, raw_input().split())
print (A-1)*(B-1)