from calendar import isleap
def main():
  Y,N,D=map(int,input().split())
  d=365-D#残り日数
  if isleap(Y+1):
    d+=1
  ans1=max(0,N-D)
  ans2=min(N,d)
  print(ans1,ans2)
  return

main()