def rotate_right(x, y):
 if (len(x) == 0):
  return []
 y = (len(x) - (y % len(x)))
 return (x[y:] + x[:y])

def rotate_right ( x , y ) : if ( len ( x ) == 0 ) : return [ ] y = ( len ( x ) - ( y % len ( x ) ) ) return ( x [ y : ] + x [ : y ] )
right rotates a list x by the number of steps specified in y .