Harryxun/stf_run huggingface dataset:
A, B = map(int, input().split())
max_num = 10**6
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a%b)

is_prime = [1 for i in range(max_num+1)]
primes = [0 for i in range(max_num+1)]
primes[0] = 2
index = 1
for i in range(3, max_num, 2):
    if is_prime[i] == 0:
        continue
    primes[index] = i
    index += 1
    for j in range(i, max_num, i):
        is_prime[j] = 0

r = gcd(A, B)
index = 0
while r != 1:
    if r % primes[index] == 0:
        r = r // primes[index]
    if r % primes[index] != 0:
        index+=1
print(index+1)

### FIXED CODE ###

A, B = map(int, input().split())
max_num = 10**12
def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a%b)

def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a

r = gcd(A, B)
ans = len(set(prime_factorize(r)))+1
print(ans)
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, li = ri(), rl()
min_ = inf
for i in range(1, n):
  min_ = min(abs(sum(li[0:i] - li[i:])))
print(min_)






### FIXED CODE ###

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, li = ri(), rl()
min_ = inf
for i in range(1, n):
  min_ = min(abs(sum(li[0:i]) - sum(li[i:])), min_)
print(min_)
a,b = map(int,input().split())
c = list(map(int,input().split()))
c.sort(reverse=True)
for i in range(0,b):
    c[i] = 0
print(sum(c))

### FIXED CODE ###

a,b = map(int,input().split())
c = list(map(int,input().split()))
if len(c) <= b:
    b = len(c) 
c.sort(reverse=True)
for i in range(0,b):
    c[i] = 0
print(sum(c))
import sys
def input():
    return sys.stdin.readline()[:-1]
def main():
    N, Q = map(int,input().split())
    G = [[] for _ in range(N)]
    for _ in range(N-1):
        a, b = map(int,input().split())
        G[a-1].append(b-1)
        G[b-1].append(a-1)
    V = [0]*N
    for _ in range(Q):
        p, x = map(int,input().split())
        V[p-1] += x

    def dfs(mae,ima):
        for tsugi in G[ima]:
            if tsugi != mae:
                V[tsugi] += V[ima]
                dfs(ima,tsugi)
    dfs(-1,0)
    print(*V)

if __name__ == '__main__':
    main()


### FIXED CODE ###

import sys
sys.setrecursionlimit(200010)

def main():
    input = sys.stdin.readline
    N, Q = map(int,input().split())
    G = [[] for k in range(N+1)]
    for k in range(N-1):
        a, b = map(int,input().split())
        G[a].append(b)
    kyori = [0 for k in range(N+1)]
    for k in range(Q):
        p, x = map(int,input().split())
        kyori[p] -= x
    def dfs(now, dist):
        for tsugi in G[now]:
            if kyori[tsugi] <= 0:
                kyori[tsugi] = -kyori[tsugi]
                kyori[tsugi] += dist
                dfs(tsugi, kyori[tsugi])
    kyori[1] = -kyori[1]
    dfs(1,kyori[1])
    print(*kyori[1:], sep = " ")

if __name__ == '__main__':
    main()
N = int(input())
print('Yes' if N[0] == N[-1] else 'No')

### FIXED CODE ###

N = input()
print('Yes' if N[0] == N[-1] else 'No')
# coding: utf-8
# Your code here!

H, W = map(int, input().split(" "))

result = True
masu = [['0' for i in range(H+2)] for j in range(W+2)]
for h in range(1, H+1):
    s = "0"+input()+"0"
    masu[h] = list(s)

# print(masu)

for h in range(1,H+1):
    for w in range(1,W+1):
        if masu[h][w] == "#":
            if ("#" == masu[h+1][w]) or ("#" == masu[h][w+1]) or ("#" == masu[h-1][w]) or ("#" == masu[h][w-1]):
                pass
            else:
                result = False

if result:
    print("Yes")
else:
    print("No")

### FIXED CODE ###


H, W = map(int, input().split(" "))

# result = True
masu = [['.' for i in range(W+2)] for j in range(H+2)]
for h in range(H):
    s = "."+input()+"."
    masu[h+1] = s

# print(masu)

for h in range(1,H+1):
    for w in range(1,W+1):
        if masu[h][w] == "#":
            if "#" == masu[h+1][w] or "#" == masu[h][w+1] or "#" == masu[h-1][w] or "#" == masu[h][w-1]:
                pass
            else:
                # result = False
                print("No")
                exit()

print("Yes")
def main():
    import sys
    input=sys.stdin.readline
    s=input()
    alpha="abcdefghijklmnopqrstuvwxyz"
    l=len(s)
    alpha2={j:i for i,j in enumerate(alpha)}
    memo=[[0]*26 for _ in range(l,-1,-1)]
    for i in range(26):
        memo[l][i]=l+1
    for i in range(l-1,-1,-1):
        for x,y in alpha2.items():  
            memo[i][y]=memo[i+1][y]
        memo[i][alpha2[s[i]]]=i+1
    
    search=[1]*(l+2)
    search[l+1]=0
    for i in range(l-1,-1,-1):
        m=max([memo[i][j] for j in range(26)])
        if m!=l+1:
            search[i]=search[m]+1
    
    n,seq=0,0
    ans_len=search[0]
    ans=""
    temp=0
    for i in range(ans_len):
        for j in range(26):
            n=memo[temp][j]
            seq=search[n]+i
            if seq+1==ans_len:
                ans+=alpha[j]
                temp=memo[temp][j]
                break
    print(ans)
if __name__=='__main__':
    main()

### FIXED CODE ###

def main():
    import sys
    input=sys.stdin.readline
    s=input()
    alpha="abcdefghijklmnopqrstuvwxyz"
    l=len(s)
    alpha2={j:i for i,j in enumerate(alpha)}
    memo=[[0]*26 for _ in range(l,-1,-1)]
    for i in range(26):
        memo[l][i]=l+1
    for x,y in alpha2.items():
        for i in range(l-1,-1,-1):
            if s[i]==x:
                memo[i][y]=i+1
            else:
                memo[i][y]=memo[i+1][y]
    
    search=[1]*(l+2)
    search[l+1]=0
    for i in range(l-1,-1,-1):
        m=max([memo[i][j] for j in range(26)])
        if m!=l+1:
            search[i]=search[m]+1
    
    n,seq=0,0
    ans_len=search[0]
    ans=""
    temp=0
    for i in range(ans_len):
        for j in range(26):
            n=memo[temp][j]
            seq=search[n]+i
            if seq+1==ans_len:
                ans+=alpha[j]
                temp=memo[temp][j]
                break
    print(ans)
if __name__=='__main__':
    main()
import sys

N = int(sys.stdin.readline().strip())
X = sys.stdin.readline().strip()

def f(num):
    if num == 0:
        return 0
    elif num == 1 or num == 2:
        return 1
    
    b = bin(num)
    popcnt = b.count('1')
    
    if num % popcnt == 0:
        return 1
    elif popcnt == 0:
        return 0
    else:
        return f(num % popcnt) + 1

nX = int(X, 2)
pcnt = X.count('1')

nXp = nX%(pcnt+1)
if not pcnt == 1:
    nXm = nX%(pcnt-1)
delta = 2**(N-1)
for i in range(0, N):
    if X[i] == '0':
        print(f((nXp + (delta%(pcnt+1)))%(pcnt+1)) + 1)
    else:
        if pcnt == 1:
            print(0)
            continue
        print(f((nXm - (delta%(pcnt-1)))%(pcnt-1)) + 1)
        

    delta = int(delta/2)

### FIXED CODE ###

import sys

N = int(sys.stdin.readline().strip())
X = sys.stdin.readline().strip()

def popcount(n):
    cnt = 0
    while n > 0:
        cnt += n & 1
        n //= 2
    return cnt

def f(n):
    cnt = 0
    while n != 0:
        n = n % popcount(n)
        cnt += 1
    return cnt

#nX = int(X, 2)
pcnt = X.count('1')
MOD1 = pcnt + 1
MOD2 = pcnt - 1

nXp = 0
nXm = 0

pow1 = [1] * N
pow2 = [0] * N
for i in range(1, N):
    pow1[i] = (pow1[i-1] * 2) % MOD1
if MOD2 != 0:
    pow2[0] = 1
    for i in range(1, N):
        pow2[i] = (pow2[i-1] * 2) % MOD2

for i in range(N):
    if X[i] == '1':
        nXp += pow1[N-1-i]
nXp %= MOD1

if MOD2 != 0:
    for i in range(N):
        if X[i] == '1':
            nXm += pow2[N-1-i]

    nXm %= MOD2
    

for i in range(0, N):
    if X[i] == '0':
        k = (nXp + pow1[N-1-i]) % MOD1
        print(f(k) + 1)
    else:
        if MOD2 == 0:
            print(0)
        else:
            k = (nXm - pow2[N-1-i]) % MOD2
            print(f(k) + 1)
s = input()
for a in s and b in s and c in s:
    print('Yes')
else:
    print('No')

### FIXED CODE ###

s = input()
if s.count('a') == 1 and s.count('b') == 1:
    print('Yes')
else:
    print('No')
import math

a = int(input())
b = float(input())

print(math.floor(a*b))

### FIXED CODE ###

a, b = input().split()

a = int(a)
b1, b2 = b.split('.')

ans = a * (int(b1) * 100 + int(b2)) // 100
print(ans)
import numpy as np
import copy as cp

n = int(input())
a = list(map(int,input().split()))

def nck(n,k):
    if 0 <= k <= n:
        ret = 1
        for i in range(k):
            ret = ret*(n-i)/(i+1)
        return ret
    return 0

def numzero(a):
    if a <= 1:
        return 0
    elif a == 2:
        return 1
    else: return nck(a,2)

cumsum = [0]
s = 0
for i in range(len(a)):
    s += a[i]
    cumsum.append(s)
#print(cumsum)

v = cp.deepcopy(cumsum)
v.sort()
cnt = np.zeros(v[-1]-v[0]+1)

for i in range(len(cumsum)):
    #print(i,cumsum[i])
    cnt[cumsum[i]-v[0]] += 1
    #print(cnt)
#print(cnt)

ans = 0
for i in range(len(cnt)):
    ans += numzero(cnt[i])
print(int(ans))

### FIXED CODE ###

#import numpy as np
import copy as cp

n = int(input())
a = list(map(int,input().split()))

def nck(n,k):
    if 0 <= k <= n:
        ret = 1
        for i in range(k):
            ret = ret*(n-i)/(i+1)
        return ret
    return 0

def numzero(a):
    if a <= 1:
        return 0
    elif a == 2:
        return 1
    else: return nck(a,2)

cumsum = [0]
s = 0
for i in range(len(a)):
    s += a[i]
    cumsum.append(s)
#print(cumsum)

v = cp.deepcopy(cumsum)
v.sort()
#print(v)

cnt = [1]
c = 0
for i in range(1,len(v)):
    if v[i] == v[i-1]:
        cnt[c] += 1
    else:
        cnt.append(1)
        c += 1
#print(cnt)    

ans = 0
for i in range(len(cnt)):
    ans += numzero(cnt[i])
print(int(ans))
N,X=map(int,input().split())
L=list(map(int,input().split()))
p=1
dt=0
i=1
while dt<=X:
  dt=dt+L[i-1]
  i=i+1
  if dt<=X and p<=N+1:
    p=p+1
  #print(dt)
print(p)

### FIXED CODE ###

N,X=map(int,input().split())
L=list(map(int,input().split()))
p=1
dt=0
i=1
for i in range(N):
  dt=dt+L[i]
  if dt<=X:
    p=p+1
  else:
    break
print(p)
a,b=int(input().split())
print(a*b)

### FIXED CODE ###

a,b=input().split()
print(int(a)*int(b))
a = 0
b = 0
yama1 = []
yama2 = []
pop_block = []
while True:
	x = map(str,raw_input().split(' '))
	if x[0] == 'quit':
		break
	elif x[0] == 'push':
		if X[1] == '1':
			yama1.append(x[2])
			a += 1
		elif x[1] == '2':
			yama2.append(x[2])
			b += 1
		continue
	elif x[0] == 'pop':
		if X[1] == '1':
			pop_block.append(yama1[a-1])
			yama1.remove(yama1[a-1])
			a -= 1
		elif x[1] == '2':
		pop_block.append(yama2[b-1])
		yama2.remove(yama2[b-1])
		b -= 1
		continue
	elif x[0] == 'remove':
		if X[1] == '1':
			yama2.append(yama1[a-1])
			yama1.remove(yama1[a-1])
			a -= 1
			b += 1
		elif x[1] == '2':
			yama1.append(yama2[b-1])
			yama2.remove(yama2[b-1])
			b -= 1
			a += 1
for val in pop_block:
	print val

### FIXED CODE ###

n = input()
mountains = [[] for x in range(1,n+1)]
popblock = []
while True:
	x = map(str,raw_input().split(' '))
	if x[0] == 'quit':
		break
	else:
		mt_num = int(x[1])-1
		if x[0] == 'push':
			mountains[mt_num].insert(0,x[2])
		elif x[0] == 'pop':
			popblock.append(mountains[mt_num][0])
			del mountains[mt_num][0]
		elif x[0] == 'move':
			mt_num2 = int(x[2])-1
			mountains[mt_num2].insert(0,mountains[mt_num][0])
			del mountains[mt_num][0]
		continue
for val in popblock:
	print val
N, K = list(map(int, input().split()))
H = list(map(int, input().split()))

def memoize(f):
    cache = {}
    def helper(x):
        if x not in cache:
            cache[x] = f(x)
        return cache[x]
    return helper


@memoize
def jump(i):
    if i == 0:
        return 0
    mn = int(10 ** 9)
    for j in range(1, K + 1):
        if i - j >= 0:
            mn = min(mn, abs(H[i] - H[i - j]) + jump(i - j))
    return mn

print(jump(N - 1))

### FIXED CODE ###

import sys
import numpy as np

N, K = [int(v) for v in input().strip().split(' ')]

H = np.array([int(v) for v in sys.stdin.readline().strip().split(' ')])

dp = np.zeros(N, dtype=int)

for i in range(1, N):
    st = max(0, i - K)
    dp[i] = min(dp[st : i] + np.abs(H[i] - H[st : i]))

print(dp[-1])
x = list(map(str,input().split()))
if '2' == x.value_counts('5') and '1' == x.value_counts('7'):
  print('YES')
else:
  print('NO')

### FIXED CODE ###

x = list(map(str,input().split()))
if x.count('5') == 2 and x.count('7') == 1:
  print('YES')
else:
  print('NO')
def palindrome(word):
  if len(word) <= 1:
    return True
  if word[0] != word[-1]:
    return False
  return palindrome(word[1:-1])

word = input()
n = len(word) // 2
issuper = palindrome(word[:n]) and palindrome(word[n+1:])
print("Yes" if isupper else "No")

### FIXED CODE ###

def palindrome(word):
  if len(word) <= 1:
    return True
  if word[0] != word[-1]:
    return False
  return palindrome(word[1:-1])
 
word = input()
n = len(word) // 2
issuper = palindrome(word[:n]) and palindrome(word[n+1:]) and palindrome(word)
print("Yes" if issuper else "No")
s=input()
x = chr(ord(ch) + 1)
print(x)

### FIXED CODE ###

s=input()
print(chr(ord(s)+1))
n, m = map(int, input().split())

array = [[int(x) for x in input().split()] for x in range(m)]

adj_array = [[] for x in range(m + 1)]
res_array = [True] + [False for x in range(m)]
for item in array:
    adj_array[item[0]].append(item[1])
    adj_array[item[1]].append(item[0])


def dfs(n, res_array, res):
    res_array[n] = True
    if False not in res_array:
        return res+1
    else:
        for next in adj_array[n]:
            if not res_array[next]:
                res = dfs(next, list(res_array), res)
    return res


res = 0
res_array[1] = True
print(dfs(1, res_array, res))


### FIXED CODE ###

import sys

n, m = map(int, input().split())

array = [[int(x) for x in input().split()] for x in range(m)]

if m == 0:
    print(0)
    sys.exit()

adj_array = [[] for x in range(n + 1)]
res_array = [True] + [False for x in range(n)]
for item in array:
    adj_array[item[0]].append(item[1])
    adj_array[item[1]].append(item[0])


def dfs(n, res_array, res):
    res_array[n] = True
    if False not in res_array:
        return res+1
    else:
        for next in adj_array[n]:
            if not res_array[next]:
                res = dfs(next, list(res_array), res)
    return res


res = 0
res_array[1] = True
print(dfs(1, res_array, res))
n = int(input())
p = list(map(int, input().split()))

ans = 0

#+2まで考慮してるから、nの数を-2にして調整しろ
for i in range(n-2):
	if p[i] < p[i + 1] < p[i + 2] or p[i + 2] < p[i + 1] < p[i]:
		ans = ans + 1

print(ans)

### FIXED CODE ###

S = input()
if S[0] == S[1] == S[2] == S[3]:
  print('No')
elif (S[0] == S[1] and S[2] == S[3]) or (S[0] == S[2] and S[1] == S[3]) or (S[0] == S[3] and S[1] == S[2]):
  print('Yes')
else:
  print('No')
list = [int(input()) for i in range(5)]
t = 0
cnt_l = []
for i in range(5):
    cnt = 0
    while list[i] % 10 != 0:
        list[i] += 1
        cnt += 1
    t += list[i]
    if cnt != 0:
        cnt_l.append(cnt)
if not cnt:
    cnt.append(0)
print(t - max(cnt_l))

### FIXED CODE ###

list = [int(input()) for i in range(5)]
t = 0
cnt_l = []
for i in range(5):
    cnt = 0
    while list[i] % 10 != 0:
        list[i] += 1
        cnt += 1
    t += list[i]
    if cnt != 0:
        cnt_l.append(cnt)
if not cnt_l:
    cnt_l.append(0)
print(t - max(cnt_l))
from sys import stdin
input = stdin.readline

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

ls = []
s = set([])

a = X
s.add(a)
ls.append(a)

while True:
    a = pow(a, 2, M)

    if a in s:
        ind = ls.index(a)
        break
    elif len(ls) == N:
        break
    else:
        s.add(a)
        ls.append(a)

new_ls = ls[ind:len(ls)]

ans = sum(ls)

if len(new_ls) != 0:
    ans += sum(new_ls) * (max(0, (N - len(ls))) // len(new_ls))

    tmp = max(0, (N - len(ls))) % len(new_ls)

    if tmp != 0:
        for i in range(tmp):
            ans += new_ls[i % len(new_ls)]

print(ans)


### FIXED CODE ###

from sys import stdin
input = stdin.readline

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

ls = []
s = set([])

a = X
s.add(a)
ls.append(a)
ind = -1
new_ls = []

while True:
    a = pow(a, 2, M)

    if a in s:
        ind = ls.index(a)
        break
    elif len(ls) == N:
        break
    else:
        s.add(a)
        ls.append(a)

if ind != -1:
    new_ls = ls[ind:len(ls)]

ans = sum(ls)

if len(new_ls) != 0:
    ans += sum(new_ls) * (max(0, (N - len(ls))) // len(new_ls))

    tmp = max(0, (N - len(ls))) % len(new_ls)

    if tmp != 0:
        for i in range(tmp):
            ans += new_ls[i % len(new_ls)]

print(ans)
h,w=map(int,input().split())
l=[]
n=0
m=0
cou=0
for i in range(h):
    x=input()
    if x==("."*w):
        cou+=1
        continue
    l.append(list(x))
for i in range(w-1):
    k=0
    for j in range(h-cou):
        if l[j][i]==".":
            k+=1
    if k==h-cou:
        for d in range(h-cou):
            del l[d][i]
for i in range(h-cou):
    l[i]="".join(l[i])
    print(l[i])



### FIXED CODE ###

h,w=map(int,input().split())
a=[list(input()) for i in range(h)]
#print(a)
H=[]
W=[]
for i in range(h):
    count=0
    for j in range(w):
        if a[i][j]==".":
            count+=1
    if count==w:
        H.append(i)
for i in range(w):
    count=0
    for j in range(h):
        if a[j][i]==".":
            count+=1
    if count==h:
        W.append(i)
for i in range(1,len(H)+1):
    for j in range(w):
        a[H[-1*i]][j]=""
for i in range(1,len(W)+1):
    for j in range(h):
        a[j][W[-1*i]]=""

for i in range(h):
    if not ("." in a[i] or "#" in a[i]):
        continue
    print("".join(a[i]))
def resolve():
    N, M = [int(i) for i in input().split()]
    print(A*B)


resolve()


### FIXED CODE ###

def resolve():
    N, M = [int(i) for i in input().split()]
    print(N*M)


resolve()
import unittest

from A01 import solve
from A01 import parse_input


class TestA01Solve(unittest.TestCase):

    def test_solve(self):

        lines_as_string = """
4
"""
        r = parse_input(lines_as_string)
        print(r)
        print("")
        self.assertEqual(solve(*r), 1)

        lines_as_string = """
999999
"""
        r = parse_input(lines_as_string)
        print(r)
        print("")
        self.assertEqual(solve(*r), 499999)


if __name__ == '__main__':
    unittest.main()

### FIXED CODE ###

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

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    n = int(lines[0])

    return (n, )

def solve(n):

    if n <= 2:
        return 0
    
    k = (n - 1 ) // 2  
    

    return int(k)
    


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()
if __name__ == "__main__":
    N = int(input())
    A = map(int, input().split())
    even_ls = [i for i in A if i%2 == 0 ]
    for i in even_ls:
        if i % 3 == 0 or i % 5 == 0:
            ret = "APPROVED"
        else:
            ret  = "DENIED"
            break
    print(ret)


### FIXED CODE ###



if __name__ == "__main__":
    N = int(input())
    A = map(int, input().split())
    for i in A:
        if i % 2 ==0:
            if i % 3 != 0 and i % 5 != 0:
                    print("DENIED")
                    exit(0)
            else:
                pass
        else:
            pass
    print("APPROVED")
a,b,c,d,e,f=[int(i) for i in input().split()]


max_a=f//(100*a)
max_b=f//(100*b)
max_c=f//c
max_d=f//d



#水リスト
x_list=[]
for i in range(max_a+1):
    for j in range(max_b+1):
         #水
        x=100*a*i+100*b*j
        if 0<x<f and x not in x_list:
            x_list.append(x)
#print(x_list)
        
#砂糖リスト
y_list=[]
for i in range(max_c+1):
    for j in range(max_d+1):
         #砂糖
        y=c*i+d*j
        if 0<y<f and y not in y_list:
            y_list.append(y)
#print(y_list)

concentration_list=[]
sugar_water_list=[]
sugar_list=[]

for i in x_list:
    for j in y_list:
        if i+j<=f and j/i<=e/100:
            concentration=100*j/(i+j)
            concentration_list.append(concentration)
            sugar_water_list.append(i+j)
            sugar_list.append(j)
                    
sugar_index=concentration_list.index(max(concentration_list))
print(sugar_water_list[sugar_index],sugar_list[sugar_index])                




### FIXED CODE ###

a,b,c,d,e,f=[int(i) for i in input().split()]

max_a=f//(100*a)
max_b=f//(100*b)
max_c=f//c
max_d=f//d

#水リスト
x_list=[]
for i in range(max_a+1):
   for j in range(max_b+1):
        #水
       x=100*a*i+100*b*j
       if 0<x<=f and x not in x_list:
           x_list.append(x)
#print(x_list)
       
#砂糖リスト
y_list=[]
for i in range(max_c+1):
   for j in range(max_d+1):
        #砂糖
       y=c*i+d*j
       if 0<=y<f and y not in y_list:
           y_list.append(y)
#print(y_list)

concentration_list=[]
sugar_water_list=[]
sugar_list=[]

for i in x_list:
   for j in y_list:
       if i+j<=f and j/i<=e/100:
           concentration=100*j/(i+j)
           concentration_list.append(concentration)
           sugar_water_list.append(i+j)
           sugar_list.append(j)
                   
sugar_index=concentration_list.index(max(concentration_list))
print(sugar_water_list[sugar_index],sugar_list[sugar_index])
import math

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

lcm = c * d / math.gcd(c, d)

bb = ((b // c) + (b // d) - (b // lcm))

aa = ((a // c) + (a // d) - (a // lcm))

print((b-a) - int(bb-aa) + 1)

### FIXED CODE ###

from fractions import gcd

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

lcm = int(c * d / gcd(c, d))

bb = int((b // c) + (b // d) - (b // lcm))

aa = int(((a-1) // c) + ((a-1) // d) - ((a-1) // lcm))

print((b-a) - int(bb-aa) + 1)
a, b, c = [int(i) for i in input()rstrip().split(" ")]
cnt = 0
for i in range(a, b+1):
    if c % i == 0:
        cnt += 1
print(cnt)


### FIXED CODE ###

a, b, c = [int(i) for i in input().rstrip().split(" ")]
cnt = 0
for i in range(a, b+1):
    if c % i == 0:
        cnt += 1
print(cnt)
import numpy as np

N, M, C = map(int, input().split())
M=[int(x) for x in input().split()]
nlist=[]

for i in range(N):
    nlist.append([int(x) for x in input().split()])

nlist=np.array(nlist)
M= np.array(M)
ans=(nlist*M+C).sum(axis=1)
print((ans>0).sum())

### FIXED CODE ###

H, W = map(int, input().split())
h, w = map(int, input().split())
print((H-h)*(W-w))
X = int(input())
Y = int(input())
if X==Y;
  print("=")
  elif X<Y;
  print("<")
  else;
  print(">")

### FIXED CODE ###

x,y = map(str, input().split())
 
print(">" if x > y else "<" if x < y else "=")
a,b,c,d = map(int, input().split())

B-A = (b-a)
C-B = (c-b)
C-A = (c-a)
if abs(B-A) <= d and abs(C-B) <= d:
    print("Yes")
elif abs(c-a) =< d:
    print("Yes") 
else:
    ("No")


### FIXED CODE ###

a,b,c,d = map(int,input().split())
B_A = abs(b - a)
C_B = abs(c - b)
C_A = abs(c - a)
if B_A <= d and C_B <=d:
    print('Yes')
elif C_A <= d:
    print('Yes')
else:
    print('No')