Pizzat

import math

data = input().split(" ")
n = int(data[0])
k = int(data[1]) * int(data[2]) # Meitä kiinnostaa vaan siivujen määrä

minimi = math.floor(k / n)
maksimi = minimi
if k % n > 0:
  maksimi += 1

print(minimi, maksimi)

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED