Problem:


Score : 100 points

Problem Statement

You are given three integers A, B and C.
Determine whether C is not less than A and not greater than B.

Constraints

-100≤A,B,C≤100 

A, B and C are all integers.

Input

Input is given from Standard Input in the following format:  

A B C

Output

If the condition is satisfied, print Yes; otherwise, print No.

Sample Input 1

1 3 2

Sample Output 1

Yes

C=2 is not less than A=1 and not greater than B=3, and thus the output should be Yes.

Sample Input 2

6 5 4

Sample Output 2

No

C=4 is less than A=6, and thus the output should be No.

Sample Input 3

2 2 2

Sample Output 3

Yes



Sample input:
1 3 2


Sample output:
Yes

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc061/tasks/abc061_d

import sys

# coding: utf-8
# Your code here!

#input_template
inpPh = 2
debug = True
debug = False
if not debug:
    inpPh = 0



    
inploc = inpPh - 1 #0,1,2


inpX_lst = []



N,M =tuple( map(lambda x: int(x),  inpX_lst.pop(0).split() ) )

elist = []    

for i in range(M):
	ai,bi,ci = list(map(lambda x: int(x), inpX_lst.pop(0).split() ))
    ai_loc, bi_loc = ai-1, bi - 1
    elist.append(( ai_loc, bi_loc,ci))

vlist =[ [None,[]] for _ in range(N)]    

for e in elist:
    a,b,c = e
    vlist[a][1].append((a,b,-c))
        
s_loc,g_loc = 0, N-1

vlist[s_loc][0] = 0
#print(vlist)

for v1 in vlist:
    v1_d,v1_elist = v1[0],v1[1]
    #print(v1_d,v1_elist)
    for e in v1_elist:
        a,b,c = e
        v2 = vlist[b]
        v2_d, v2_elist = v2
        if v1_d == None:
            continue
        elif v2_d == None or v2_d > v1_d +c:
            vlist[b][0] = v1_d + c

g0 = vlist[g_loc][0]            

for v1 in vlist:
    v1_d,v1_elist = v1[0],v1[1]
    #print(v1_d,v1_elist)
    for e in v1_elist:
        a,b,c = e
        v2 = vlist[b]
        v2_d, v2_elist = v2
        if v1_d == None:
            continue
        elif v3_d == None or v2_d > v1_d +c:
            vlist[b][0] = v1_d + c

g1 = vlist[g_loc][0]  

if g0 != g1:
    print('inf')
else:
    print(-g0)

#print('res',g0,g1)
for v in vlist:
    #print(v)        
    pass

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc061/tasks/abc061_d

import sys

# coding: utf-8
# Your code here!

#input_template
inpPh = 2
debug = True
debug = False
if not debug:
    inpPh = 0



    
inploc = inpPh - 1 #0,1,2



inpX_lst = []
if debug and inpPh > 0:
    inpX_lst = inputXs[inploc].splitlines()


if inpPh == 0:
    N,M = tuple(map(lambda x: int(x), sys.stdin.readline().split() ) )
else:
    N,M =tuple( map(lambda x: int(x),  inpX_lst.pop(0).split() ) )

elist = []

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc061/tasks/abc061_d

import sys

# coding: utf-8
# Your code here!

#input_template
inpPh = 2
debug = True
debug = False
if not debug:
    inpPh = 0



    
inploc = inpPh - 1 #0,1,2



inpX_lst = []
if debug and inpPh > 0:
    inpX_lst = inputXs[inploc].splitlines()


if inpPh == 0:
    N,M = tuple(map(lambda x: int(x), sys.stdin.readline().split() ) )
else:
    N,M =tuple( map(lambda x: int(x),  inpX_lst.pop(0).split() ) )

elist = []    

for i in range(M):
    if inpPh == 0:
        ai,bi,ci = list(map(lambda x: int(x), sys.stdin.readline().split() ))
    else:
        ai,bi,ci = list(map(lambda x: int(x), inpX_lst.pop(0).split() ))
    
    ai_loc, bi_loc = ai-1, bi - 1
    elist.append(( ai_loc, bi_loc,ci))

vlist =[ [None,[]] for _ in range(N)]    

for e in elist:
    a,b,c = e
    vlist[a][1].append((a,b,-c))
        
s_loc,g_loc = 0, N-1

vlist[s_loc][0] = 0
#print(vlist)

for v1 in vlist:
    v1_d,v1_elist = v1[0],v1[1]
    #print(v1_d,v1_elist)
    for e in v1_elist:
        a,b,c = e
        v2 = vlist[b]
        v2_d, v2_elist = v2
        if v1_d == None:
            continue
        elif v2_d == None or v2_d > v1_d +c:
            vlist[b][0] = v1_d + c

g0 = vlist[g_loc][0]            

for v1 in vlist:
    v1_d,v1_elist = v1[0],v1[1]
    #print(v1_d,v1_elist)
    for e in v1_elist:
        a,b,c = e
        v2 = vlist[b]
        v2_d, v2_elist = v2
        if v1_d == None:
            continue
        elif v3_d == None or v2_d > v1_d +c:
            vlist[b][0] = v1_d + c

g1 = vlist[g_loc][0]  

if g0 != g1:
    print('inf')
else:
    print(-g0)

#print('res',g0,g1)
for v in vlist:
    #print(v)        
    pass

Submission status: Runtime Error

Solution code:
#https://atcoder.jp/contests/abc061/tasks/abc061_d



# coding: utf-8
# Your code here!

#input_template
inpPh = 2
debug = True
debug = False
if not debug:
    inpPh = 0

input1 ='''
3 3
1 2 4
2 3 3
1 3 5 
'''[1:]

input2 ='''
2 2
1 2 1
2 1 1
'''[1:]

input3 ='''
6 5
1 2 -1000000000
2 3 -1000000000
3 4 -1000000000
4 5 -1000000000
5 6 -1000000000
'''[1:]



inputXs = [input1, input2, input3, None]


if debug:
    try:
        inputXs.append(inputA0)
    except:
        pass
    else:
        pass



    
inploc = inpPh - 1 #0,1,2

if inpPh > 0:
    print('selected_input:\n'+inputXs[inploc])


inpX_lst = []
if debug and inpPh > 0:
    inpX_lst = inputXs[inploc].splitlines()


if inpPh == 0:
    N,M = tuple(map(lambda x: int(x), sys.stdin.readline().split() ) )
else:
    N,M =tuple( map(lambda x: int(x),  inpX_lst.pop(0).split() ) )

elist = []    

for i in range(M):
    if inpPh == 0:
        ai,bi,ci = list(map(lambda x: int(x), sys.stdin.readline().split() ))
    else:
        ai,bi,ci = list(map(lambda x: int(x), inpX_lst.pop(0).split() ))
    
    ai_loc, bi_loc = ai-1, bi - 1
    elist.append(( ai_loc, bi_loc,ci))

vlist =[ [None,[]] for _ in range(N)]    

for e in elist:
    a,b,c = e
    vlist[a][1].append((a,b,-c))
        
s_loc,g_loc = 0, N-1

vlist[s_loc][0] = 0
#print(vlist)

for v1 in vlist:
    v1_d,v1_elist = v1[0],v1[1]
    #print(v1_d,v1_elist)
    for e in v1_elist:
        a,b,c = e
        v2 = vlist[b]
        v2_d, v2_elist = v2
        if v1_d == None:
            continue
        elif v2_d == None or v2_d > v1_d +c:
            vlist[b][0] = v1_d + c

g0 = vlist[g_loc][0]            

for v1 in vlist:
    v1_d,v1_elist = v1[0],v1[1]
    #print(v1_d,v1_elist)
    for e in v1_elist:
        a,b,c = e
        v2 = vlist[b]
        v2_d, v2_elist = v2
        if v1_d == None:
            continue
        elif v3_d == None or v2_d > v1_d +c:
            vlist[b][0] = v1_d + c

g1 = vlist[g_loc][0]  

if g0 != g1:
    print('inf')
else:
    print(-g0)

#print('res',g0,g1)
for v in vlist:
    #print(v)        
    pass

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
if A =< C and C =< B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
A, B, C = map(int, input().split())
if A =< C =< B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
print('YNeos'[(not A<=C<=B)::2])

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input().split())
print("YNeos"[!(A<=C<=B)::2])

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())
print("YNeos"[!(A<=C<=B)::2])

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main (void){
	long long n,k;
  	cin >> n >> k;
    long long li[1000000];
  	for (long long i=0;i<1000000;i++){
      li[i]=0;
    }
  	for (long long i=0;i<n;i++){
      long long a,b;
      cin>>a>>b;
      li[a]+=b;
    }
  //cout << n << ","<<k<<endl;  	
  long long s =0;
  for (long long i=0;i<1000000;i++){
      s+=li[i];
      if(s>=k){
        cout << i << endl;
        break;
      }
      //cout << li[i] << "," << s << endl;
    }
}

Submission status: Runtime Error

Solution code:
a, b, c = map(int(input().split()))
if a <= c and c <= b:
	print("Yes")
else:
	print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

print("Yes" if a <= c <= b else "No)

Submission status: Runtime Error

Solution code:
N,M = map(int,input())
bucket = {}
for i in range(N):
  bucket[i] = 0
for m in range(M):
  tempa,tempb = map(int,input())
  bucket[tempa-1] += 1
  bucket[tempb-1] += 1
for i in range(N):
  print(bucket[i])

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input())
print("Yes" if a<=c<=b else "No")

Submission status: Runtime Error

Solution code:
A,B,C=map(int, input().split())
if A<=C and C<=B:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
A,B,C=map(int, input().split())
if A<C and C<B:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
list=[0]*(10**5+1)
for i in range(n):
    a,b=map(int,input().split())
    list[a]+=b
sum=0
for l in range(1,len(list)):
    sum+=list[l]
    if sum>=k:
        print(l)
        exit()

Submission status: Runtime Error

Solution code:
a, b, c, = map(int, input().split())
print("Yes") if a <= c =< b else print("No")

Submission status: Runtime Error

Solution code:
a, b, c, = map(int, input().split())
pront("Yes") if a <= c =< b else print("No")

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
L=[]
for s in range(n):
  a,b=map(int,input().split())
  L.append((a,b))
#print(L)
L=sorted(L,key=lambda x:x[0])
#print(L)
sun=0
for s in L:
  sun+=s[1]
  if sun+1>k:
    print(s[0])
    exit()

Submission status: Runtime Error

Solution code:
a, b, c = map(int  input().split())

if a <= c and c <= b:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a, b, c = map(int  input().split())

if a <= c amd c <= b:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A,B,C=map(input().split())
if A<=C and B>=C:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
import sys


def input(): return sys.stdin.readline().strip()


N, M = (list)(map(int, input().split()))
edge = []

for _ in range(M):
    edge.append((list)(map(int, input().split())))


inf = 10**15

d = [inf]*(N+1)
d[1] = 0
ans = inf
for i in range(N-1):
    for a, b, c in edge:
        c = -c
        new_d = d[a]+c
        if d[a] != inf and d[b] > new_d:
            d[b] = new_d

for a, b, c in edge:
    c = -c
    new_d = d[a]+c
    if d[b] > new_d:
        d[b] = new_d
        if b == N:
            print('inf')
            exit()
print(-d[-1])

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input(),split())

if c>=a and b<=a:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
a,b,c=[int(i) for i in input().split()]
print(["No" "Yes"][a<=c and c<=b])

Submission status: Runtime Error

Solution code:
N, K= map(int, input().split())
g = []
for i in range(N):
    a, b = map(int, input().split())
    h=b*(b+1)/2
    if h>=K:
        g.append(a)
print(g[0])

Submission status: Runtime Error

Solution code:
N, K= map(int, input().split())
h=0
for i in range(N):
    a, b = map(int, input().split())
    h+=b
    if h>=K:
        print(a)
        break

Submission status: Runtime Error

Solution code:
N, K = list(map(int, input().strip().split()))
grid = []
k = 0
j = 0
for i in range(N):
	array = list(map(int, input().strip().split()))
	grid.append(array)
for i in range(N):
	if k < K:
		k += grid[i-1][1]
		j += 1
print(str(grid[j][0])[K-k])

Submission status: Runtime Error

Solution code:
A, B, C = int(input().split())
if A <= C and C <= B:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
if a<=c<=b:
  promt('Yes')
else:
  print('No')

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
print("Yes" a <= c and c <= b else "No")

Submission status: Runtime Error

Solution code:
a, b, c = int(input()).split()
print("Yes" if a <= c and c <= b else "No")

Submission status: Runtime Error

Solution code:
A,B,C=map(int, input().split())
print("Yes" if A<=C<=B else'No)

Submission status: Runtime Error

Solution code:
a,b,c = list(map(int, input()))
if a <= c and c <= b:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
ab = []
for i in range(M):
    ab += list(map(int, input().split()))

for i in range(1, N+1):
    print(ab.count(i))

Submission status: Runtime Error

Solution code:
a,b,c=input().split()

int a
int b
int c

if  (c>=a) and (c<=b):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b,c=input().split()

int a
int b
int c

if  (c>=a)and(c<=b):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())

if  (c>=a)and(c<=b):
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
a,b,c=input().split()

int a
int b
int c

if c=>a and c=<b:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
a,b,c=input().split()

int a
int b
int c

if c>=a and c<=b:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
a,b,c=input().split

int a
int b
int c

if c>=a and c<=b:
    print('YES')
else:
    print('NO')

Submission status: Runtime Error

Solution code:
a,b,c=int(input().split());print(("No","Yes")[a<=c<=b])

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
c = [map(int,input().split()) for i in range(M)]
result = [0]*N

for a,b in c:
    result[a-1] += 1
    result[b-1] += 1

for i in result:
    print(i)

Submission status: Runtime Error

Solution code:
n,k=map(int, input().split())
a=[list(map(int, input().split())) for i in range(n)]
a.sort()
#print(a)
b=[]
for i,j in a:
    b=b+[i]*j
    if len(b)>k:break
print(b[k-1])

Submission status: Runtime Error

Solution code:
A, B, C = map(int, iinput().split())
if A <= C and B >= C:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
A,B,C = map(int. input().split(' '))
if A <= C <= B: print('Yes')
else: print('No')

Submission status: Runtime Error

Solution code:
p=map(int,input().split());print('Yes'if p[0]<=p[2]<=p[1]else'No')

Submission status: Runtime Error

Solution code:
p=map(int,input().split());print('Yes'if p[0<=p[2]<=p[1]else'No')

Submission status: Runtime Error

Solution code:
n,k = (int(i) for i in input().split())
x = [[int(i) for i in input().split()] for i in range(n)]
x.sort()
num = 0
for i in x:
	num += i[1]
	if num>=k:
		print(i[0])
		break

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input()split())
if a<=c<=b:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
n, k = map(lambda x: int(x), raw_input().split(" "))

d = {}
d2 = {}
count = 0
for i in range(n):
    a1, b1 = map(lambda x: int(x), raw_input().split(" "))
    count += b1
    if a1 in d.keys():
        d[a1] += count
    else:
        d[a1] = count

for item in sorted(d.items()):
    if item[1] >= k:
        print item[0]
        break

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
import math
import sys
import itertools
import numpy as np
import functools
import collections
mo = 1000000007
INF = 10**100
r = range

class infix(object):
    def __init__(self, function):
        self.function = function

    def __ror__(self, other):
        self.left = other
        return self

    def __or__(self, other):
        return self.function(self.left, other)

    def __call__(self, value1, value2):
        return self.function(value1, value2)

@infix
def c(f_t_u, f_u_r): return lambda t: f_u_r(f_t_u(t))

class _Ap(object):
    def __rlshift__(self, other):
        self.value = other
        return self

    def __rshift__(self, other):
        return other(self.value)
Ap = _Ap()
ap = Ap

#d = {1:2, 3:5, 6:10, 1000043:3814}
#zip(d.keys(), d.values())<<ap>>(list |c| sorted |c| reversed |c| list |c| print)

n,m=map(int,input().split())
c=dict()
ret=[]
for i in range(m):
    ret+=map(int,input().split())<<ap>>list

for i in range(n):
    print(ret.count(i+1));

Submission status: Runtime Error

Solution code:
N, M = map(int,input().split())
tree = {}

for i in range(M):
    a, b, c = map(int, input().split())
    v= tree.get(a,[])
    v.append([b, c])
    tree[a] = v

def has_loop(tree):
    pass

m = []
def cost(v, c, visited):
    if v in visited:
        print('inf')
        exit()
    b = tree.get(v, None)
    if b is None:
        return 
    elif len(b) == 1 and tree.get(b[0][0],None) == None:
        j = c+b[0][1]
        m.append(j)
    else:
        for b, c2 in b: 
            cost(b, c+c2, visited + [v])

if has_loop(tree):
    print('inf')
    exit()

cost(1, 0, [])
print(max(m))

Submission status: Runtime Error

Solution code:
N, K = map(int,input().split())

l = []

for i in range(N):
    a, b = map(int, input().split())
    l += [a] * b

print(sorted(l)[K-1])

Submission status: Runtime Error

Solution code:
a b c = map(int, input().split())

if a<=c and c<=b:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a b c = map(int, input().split())

if a<=c and c<=b:
    print("Yes")
else:
    print(”No”)

Submission status: Runtime Error

Solution code:
xs = map(int, raw_input().split())

if xs[2] >= xs[0] and xs[2] <= xs[1]:
    print "Yes"
else:
    print "No"

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
temp = []
c,t = K,-1
for i in range(N):
    temp.append(list(map(int,input().split())))
    temp.sort()
while c>0:
    t += 1
    c -= temp[t][1]
print(temp[t][0])

Submission status: Runtime Error

Solution code:
N,M=map(int,input().split())
list1=[]
for i in range (M):
    list1 += list(map(int,input().split()))
for j in range(1,N+1):
 print (list1.count(j))

Submission status: Runtime Error

Solution code:
mport sys

a, b, c = (int (i) for i in raw_input().split())

if c >= a and c <= b:
    print 'yes'
else:
    print 'no'

Submission status: Runtime Error

Solution code:

import sys

a, b, c = (int (i) for i in raw_input().split())

if c >= a and c <= b:
    print 'yes'
else:
    print 'no'

Submission status: Runtime Error

Solution code:
def max_score(edge,N):
    inf =float("inf")
    w = [-inf for i in range(int(N)+1)]
    w[1] = 0;
    while True:
        update = False
        negative = False
        for e in edge:
            if e[0] > e[1] and e[2]>0:
                negative = True
                update = True
                break

            elif w[e[0]] != -inf and w[e[1]] < w[e[0]]+e[2] and e[0] < e[1]:
                w[e[1]] = w[e[0]]+e[2]
                update = True

        if not update:
            break

    if not negative:
        return w[int(N)]
    else:
        return "inf"


N, M = raw_input().split()
edge = []
for i in range(int(M)):
    edge.append(map(int,raw_input().split()))

print max_score(edge,int(N))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

import sys
import subprocess
import json
import time
import math
import re
import sqlite3

N, M = map(int, input().split())
l = [0] * N

for i in range(M):
    a, b = map(int, input().split())
    a -= 1; b -= 1;
    l[a] += 1
    l[b] += 1

for i in range(N):
    print(l[i])

Submission status: Runtime Error

Solution code:
N,K = map(int,input().split())
list1 = []
for i in range(N):
    list1.append(list(map(int,input().split())))
list1.sort()
list2 = []
for j in range(N):
    list2 += [list1[j][0]]*list1[j][1]
    if len(list2) >= K:
        break
print(list2[K-1])

Submission status: Runtime Error

Solution code:
a,b,c = map(int,input())
print("Yes" if a<=c<=b else "No")

Submission status: Runtime Error

Solution code:
b, c, d = map(int, input().split())
if b < c :
    if b <= d <= c :
        print('Yes')
    else :
        print('No')
else :
     if b <= d <= c :
        print('Yes')
    else :
        print('No')

Submission status: Runtime Error

Solution code:
#-*- coding: utf-8 -*-

def get_ans():
    n, k = map(int, raw_input().split())
    src = []
    for i in range(n):
        src.append(map(int, raw_input().split()))
    src.sort(key=lambda x:x[0]) # 0番目の要素でソート

    cnt = 0
    for a, b in src:
        cnt = cnt + b
        if cnt >= k:
            return a
            break
    return src[n-1][1]

if __name__ == '__main__':
    print get_ans()

Submission status: Runtime Error

Solution code:
#N,Mとa_1からb_Mまで入力
N,M = map(int,input().split())
list1 = [input() for i in range(1,2M+1)]
for i in range(M):
    list1.append(map(int,input() .split()))
    
#print list.count(l) for文で0から2M-1まで
for l in range(1,N+1):
    print(list1.count(l))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

# initialize
N,K = map(int, input().split())
list = [0] * 10**5

# In:list, Out:ans
def solve(k,l):
    for i in range(len(l)):
        k -= l[i]
        if (k <= 0):
            return i
    return 0

# Input a and b to the list
for i in range(N):
    a,b = map(int, input().split())
    list[a] += b

print(str(solve(K,list)))

Submission status: Runtime Error

Solution code:
N, M = map(int, input().split())
m_list = [0] * (N + 1)
for i in range(M):
    a, b = map(int, input().split())
    m_list[a] += 1
    m_list[b] += 1
for j in m_list[1:]:
    print(j)

Submission status: Runtime Error

Solution code:
def Judge(a, b, c):
    if a > c:
        return 'No'
    elif c > b:
        return 'No'
    else:
        return 'Yes'

Judge(map(int, raw_input().split()))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

def Judge(a, b, c):
    if a > c:
        return 'No'
    elif c > b:
        return 'No'
    else:
        return 'Yes'

Judge(map(int, raw_input().split()))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

a,b,c = map(int, raw_input().split())
if a <= c and b >= c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

a,b,c = map(int, raw_input().split())
if a <= c and b >= c:
    print('Yes')
else:
    print('No')

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

a,b,c = map(int, raw_input().split())
if a <= c and b >= c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

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

A = []

while True:
    a, b = map(int,input().split())
    B = [a for j in range(b)]
    A.extend(B)
    if len(A) >= K:
        print(A[K-1])
        break

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
string = ''
for i in range(n):
    a,b=(input().split())
    string += a*int(b)
string = [int(i) for i in string]
print(sorted(string[k-1]))

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
string = ''
for i in range(n):
    a,b=(input().split())
    string += a*int(b)
print(sorted(string)[k-1])

Submission status: Runtime Error

Solution code:
n,k=map(int,input().split())
string = ''
for i in range(n):
    a,b=(input().split())
    string += a*int(b)
print(string[k-1])

Submission status: Runtime Error

Solution code:
n,m = map(int,input().split())
l = [0]*n
for i in range(0,m):
  for j in list(map(int,input().split())):
    l[j-1]+=1
for i in range(0,n):
  print(l[i])

Submission status: Runtime Error

Solution code:

#問題文
#3 つの整数 A,B,C が与えられます。
#整数 C が A 以上 かつ B 以下であるかを判定してください。

#制約
#−100≦A,B,C≦100
#A,B,C は全て整数
#入力
#入力は以下の形式で標準入力から与えられる。

#A B C
#出力
#条件を満たす場合はYes、そうでない場合はNoを出力せよ。

A=input()
B=input()
C=input()

if C>=A and C<=B:
    print("yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
# N,Mの把握
l = list(map(int, input().split()))
N = l[0]
M = l[1]

#list(map(str, input().split()))をM回くりかえし、１つのリストにまとめる。

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

# リストを指定の番号で検索して、項目数を返す関数
def r(x):
	y = str(c.count(x))
	return y

#都市番号1からNまでリストを検索し、出力
dic = {}
for i in range(1,N+1):
	print(r(i))

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

# get three integers separated with half-width break
a, b, c = map(int, raw_input().split())
# output
if c >= a and c <= b:
    print('Yes')
else:
    print("No")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

# get three integers separated with half-width break
a, b, c = map(int, raw_input().split())
if c >= a and c <= b:
    print('Yes')
else:
    print("No")
# output

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

# get three integers separated with half-width break
a, b, c = map(int, raw_input().split())
if c >= a and c <= b:
    print('Yes')
else
    print("No")
# output

Submission status: Runtime Error

Solution code:
b = input().split(" ")
num = [0 for i in range(int(b[0]))] 
for i in range(int(b[1])):
    a = input().split(" ")
    num[int(a[0])-1] = num[int(a[0])-1]+1
    num[int(a[1])-1] = num[int(a[1])-1]+1

for i in range(int(b[0])):
    print(num[i])

Submission status: Runtime Error

Solution code:
a = input().split(" ")
num = [0 for i in range(int(a[0]))] 
for i in range(int(a[1])):
    a = input().split(" ")
    num[int(a[0])-1] = num[int(a[0])-1]+1
    num[int(a[1])-1] = num[int(a[1])-1]+1

for i in range(int(a[1])):
    print(num[i])

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
. 
if a<=c and b>=c:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
2. 
3.if a<=c and b>=c:
4.    print("Yes")
5.else:
6.    print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())

if a<=c and b>=c:
    print("Yes")
else;
    print("No")

Submission status: Runtime Error

Solution code:
n,m=map(int,input().split())
e=[tuple(map(int,input().split())) for _ in range(m)]
d=[0]+[-float('inf')]*(n-1)
for _ in range(n-1):
    for a,b,c in e:
        d[b-1]=max(d[b-1],d[a-1]+c)
r=d[n-1]
for _ in range(n-1):
    for a,b,c in e:
        d[b-1]=max(d[b-1],d[a-1]+c)
if d[n-1]==r:
    print(r)
else:
    print('inf')

Submission status: Runtime Error

Solution code:
ss=input()
abc=ss.split()
abc[0]
if abc[2]>=abc[0] and abc[2]<=abc[1]:
    print("yes")
else:
    print("no)

Submission status: Runtime Error

Solution code:
ss=input()
abc=ss.split()
abc[0]
if abc[2]>=abc[0] and anc[2]<=abc[1]:
    print("yes")
else:
    print("no)

Submission status: Runtime Error

Solution code:
import sys
from collections import defaultdict

n,k = map(int, input().split())
di = defaultdict(int)
for i in range(n):
    a, b = map(int, input().split())
    di[a] += b

cnt = 0
for x in sorted(di.keys()):
    cnt += di[x]
    if cnt >= k:
        print(x)
        sys.exit()

Submission status: Runtime Error

Solution code:
N, M = list(map(int, input().split()))
a = []
b = []
c = []

for i in range(M):
    a_i, b_i, c_i = list(map(int, input().split()))
    a.append(a_i)
    b.append(b_i)
    c.append(c_i)


cost = [-float('inf') for i in range(N)]
cost[0] = 0
flag = True

while flag:
    for k in range(M):
        cost[b[k] - 1] = max(cost[b[k] - 1], cost[a[k] - 1] + c[k])
        if k == M - 2:
            flag = False

def check():
    for k in range(M):
        if cost[b[k] - 1] < cost[a[k] - 1] + c[k]:
            return 'inf'
    return cost[N - 1]




print(check())

Submission status: Runtime Error

Solution code:
 nums = list(map(int, input().split()))
 t = nums[2]
 if (nums[0] <= t and nums[1] >= t):
     print('Yes')
 else:
     print('No')

Submission status: Runtime Error

Solution code:
N, K = map(int, input().split())
c = []
for i in range(N):
	c.append(input().split())
	
c.sort(key=lambda x: x[0])

f = 0
for i in range(N):
	f += int(c[i][1])
	if f >= K:
		print(c[i][0])
		break

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(100000)

def set_enable_goal(cur_node, back_paths, enable_goal):
    if cur_node in back_paths:
        for next_node in back_paths[cur_node]:
            if enable_goal[next_node - 1] == 0:
                enable_goal[next_node - 1] = 1
                set_enable_goal(next_node, back_paths, enable_goal)


N, M = map(int, input().split())
MIN = float('-inf')
INF_LIMIT = -MIN

back_paths = {}
all_paths = {}
for i in range(M):
    a, b, c = map(int, input().split())
    if a in all_paths:
        all_paths[a].append((b, c))
    else:
        all_paths[a] = [(b, c)]

    if b in back_paths:
        back_paths[b].append(a)
    else:
        back_paths[b] = [a]


# path cut
enable_goal= [0 for i in range(N)]
enable_goal[N - 1] = 1
set_enable_goal(N, back_paths, enable_goal)

for a, paths in all_paths.items():
    if not enable_goal[a - 1]:
        all_paths[a] = []
    else:
        valid_paths = []
        for b, c in paths:
            if enable_goal[b - 1]:
                valid_paths.append((b, c))
        all_paths[a] = valid_paths


scores = [MIN for i in range(N)]
scores[0] = 0

is_inf = False
for n in range(N):
    for a in range(1, M + 1):
        if a in all_paths:
            for b, c in all_paths[a]:
                scores[b - 1] = max(scores[b - 1], scores[a - 1] + c)

# loop check
if not is_inf:
    prev_score = scores[N - 1]
    for a in range(1, M + 1):
        if a in all_paths:
            for b, c in all_paths[a]:
                scores[b - 1] = max(scores[b - 1], scores[a - 1] + c)
    if prev_score != scores[N - 1]:
        is_inf = True


if is_inf:
    print('inf')
else:
    print(scores[N - 1])

Submission status: Runtime Error

Solution code:
nk = [int(i) for i in input().split()]
n = nk[0]
k = nk[1]
array = []
count = []
for i in range(n):
    num = input().split()
    a = num[0]
    b = int(num[1])
    k -= b
    array.append(a)
    if k <= 0:
        break
    else:
        array.pop()
print(array[0])

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-

import sys
import os
import math

N, M = map(int, input().split())
#print('N', N)
#print('M', M)

A = [[] for i in range(N)]
for i in range(M):
    a, b, c = map(int, input().split())
    a -= 1
    b -= 1
    A[a].append((b, -c))

# 始点から到達不可能な頂点は除去する
visited = [False] * N
Q = [0]
while Q:
    i = Q.pop(0)
    visited[i] = True
    for edge in A[i]:
        to = edge[0]
        if not visited[to]:
            Q.append(to)
# 到達不可能な頂点
unreachable = []
reachable = []
for i in range(N):
    if visited[i]:
        reachable.append(i)
    else:
        unreachable.append(i)
#print('unreach', unreachable)
for i in unreachable:
    A[i] = []

dists = [float('inf')] * N
dists[0] = 0
def bellman_ford(A):
    for i in reachable:
        for v in reachable:
            for edge in A[v]:
                to = edge[0]
                cost = edge[1]
                if dists[v] != float('inf') and dists[to] > dists[v] + cost:
                    dists[to] = dists[v] + cost
                    if i == N - 1:
                        return True
    return False

is_loop = bellman_ford(A)

if is_loop:
    print('inf')
else:
    # パスがある
    print(-dists[N-1])

Submission status: Runtime Error

Solution code:
i = int(raw_input().split())
if i[0] <= i[2] <= i[1]:
 print("Yes")
else:
 print("No")

Submission status: Runtime Error

Solution code:
i = raw_input().split()
if i[0] <= i[2] <= i[1]:
 print("Yes")
else:
 print("No")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print('Yes' if a <= c <= b else ''No')